Models and Scheduling Mechanisms for Global Computing Applications
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Computational Co-op: Gathering Clusters into a Metacomputer
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
A Case for Economy Grid Architecture for Service Oriented Grid Computing
IPDPS '01 Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2
The Grid 2: Blueprint for a New Computing Infrastructure
The Grid 2: Blueprint for a New Computing Infrastructure
On Scheduling Mesh-Structured Computations for Internet-Based Computing
IEEE Transactions on Computers
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
IEEE Transactions on Computers
On Scheduling Complex Dags for Internet-Based Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Record of the Project MAC conference on concurrent systems and parallel computation
An observation on time-storage trade off
Journal of Computer and System Sciences
Internet computing of tasks with dependencies using unreliable workers
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Assessing the computational benefits of AREA-oriented DAG-scheduling
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
A pebble game for internet-based computing
Theoretical Computer Science
Hi-index | 0.01 |
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional computing platforms. The looser coupling among participating computers makes it harder to utilize remote clients well, and raises the specter of a kind of “gridlock” that ensues when a computation stalls because no new tasks are eligible for execution. This paper studies the problem of scheduling computation-dags in a manner that renders tasks eligible for execution at the maximum possible rate. Earlier work has developed a framework for such scheduling when a new task is allocated to a remote client as soon as it returns the results from an earlier task. The proof in that work that many dags cannot be scheduled optimally within this paradigm signaled the need for a companion theory that addresses the scheduling problem for all computation-dags. A new, batched, scheduling paradigm for Internet-based computing is developed in this work. Although optimal batched schedules always exist, computing such a schedule is NP-Hard, even for bipartite dags. In response, a polynomial-time algorithm is developed for producing optimal batched schedules for a rich family of dags obtained by “composing” tree-structured building-block dags. Finally, a fast heuristic schedule is developed for “expansive” dags.