Computers and Biomedical Research
Future Generation Computer Systems - Special issue on metacomputing
SETI@home: an experiment in public-resource computing
Communications of the ACM
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Simgrid: A Toolkit for the Simulation of Application Scheduling
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Master/Slave Computing on the Grid
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Master-slave Tasking on Heterogeneous Processors
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Entropia: architecture and performance of an enterprise desktop grid system
Journal of Parallel and Distributed Computing - Special issue on computational grids
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
IEEE Transactions on Parallel and Distributed Systems
The master-slave paradigm with heterogeneous processors
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication times. The single-port, full overlap model is used for modeling the activities of the nodes. A distributed method for determining the maximum steady-state throughput of a tree is presented. Then, we show how each node can build up its own local schedule independently of the rest of the platform. In addition, the final schedule is asynchronous and event-driven, meaning that each node (except the root) acts without any time-related information. A local scheduling strategy which aims at minimizing the amount of tasks buffered at node locations during steady-state is introduced. As a consequence, the lengths of the start-up and winddown phases are considerably reduced.