An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
Journal of the ACM (JACM)
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments
IEEE Transactions on Parallel and Distributed Systems
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
SETI@HOME—massively distributed computing for SETI
Computing in Science and Engineering
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Scalable Parallel Computing: Technology,Architecture,Programming
Scalable Parallel Computing: Technology,Architecture,Programming
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 Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
Toward a Theory for Scheduling Dags in Internet-Based Computing
IEEE Transactions on Computers
Scheduling DAGs on asynchronous processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
Theory of Computing Systems
Extending IC-Scheduling via the Sweep Algorithm
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Dynamically scheduling divisible load for grid computing
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
An adaptive scheduling method for grid computing
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
The master-slave paradigm with heterogeneous processors
IEEE Transactions on Parallel and Distributed Systems
Area-maximizing schedules for series-parallel DAGs
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Assessing the computational benefits of AREA-oriented DAG-scheduling
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Performing dynamically injected tasks on processes prone to crashes and restarts
DISC'11 Proceedings of the 25th international conference on Distributed computing
Stochastic DAG scheduling using a Monte Carlo approach
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
A key challenge when scheduling computations over the Internet is temporal unpredictability: remote ''workers'' arrive and depart at unpredictable times and often provide unpredictable computational resources; the time for communication over the Internet is impossible to predict accurately. In response, earlier research has developed the underpinnings of a theory of how to schedule computations having intertask dependencies in a way that renders tasks eligible for execution at the maximum possible rate. Simulation studies suggest that such scheduling: (a) utilizes resource providers' computational resources well, by enhancing the likelihood of having work to allocate to an available client; (b) lessens the likelihood of a computation's stalling for lack of tasks that are eligible for execution. The applicability of the current version of the theory is limited by its demands on the structure of the dag that models the computation being scheduled-namely, that the dag be decomposable into connected bipartite ''building-block'' dags. The current paper extends the theory by developing the Sweep Algorithm, which takes a significant step toward removing this restriction. The resulting augmented suite of scheduling algorithms allows one to craft optimal schedules for a large range of dags that the earlier framework could not handle. Most of the newly optimally scheduled dags presented here are artificial but ''close'' in structure to dags that arise in real computations; one of the new dags is a component of a large dag that arises in a functional Magnetic Resonance Imaging application.