Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Abstract. Imaging applications such as filtering, image transforms and compression/decompression require vast amounts of computing power when applied to large data sets. These appl...
Benoit A. Gennart, Marc Mazzariol, Vincent Messerl...