An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction to Algorithms
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
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling
IPDPS '03 Proceedings of the 17th International 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
Models and Scheduling Mechanisms for Global Computing Applications
IPDPS '02 Proceedings of the 16th International Symposium on Parallel and Distributed Processing
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
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
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 5.23 |
Advances in technology have rendered the Internet a viable medium for employing multiple independent computers collaboratively in the solution of a single computational problem, leading to the new genre of collaborative computing that we term Internet-based computing (IC). Scheduling a computation for IC presents challenges that were not encountered with earlier modalities of collaborative computing, especially when the computation's constituent tasks have interdependencies that constrain their order of execution. This paper surveys an ongoing study of (an abstraction of) the scheduling problem for such computations for IC. The work employs a “pebble game on computation-dags,” that abstracts the process of allocating a computation's interdependent tasks to participating remote computers. The goal of a schedule, motivated by two related scheduling challenges, is to maximize the production rate of tasks that are eligible for execution. First, in many modalities of IC, remote computers become available at unpredictable times. Always having a maximal number of execution-eligible tasks enhances the utilization of available resources. Second, the fact that remote computers are often not dedicated to this IC computation, hence, may be more dilatory than anticipated, can lead to a type of “gridlock” that results when a computation stalls because (due to dependencies) all execution-eligible tasks are already allocated to remote computers. These motivating challenges raise the hope that the optimality results presented here within an abstract IC setting have the potential of improving efficiency and fault-tolerance in real IC settings.