Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
Mark Silberstein, Dan Geiger, Assaf Schuster, Miro...
There has been a growing interest in designing multi-agent based interactive dramas. A key research challenge faced in the design of these systems is to support open-ended user in...
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...