Introduction to algorithms
On multicast algorithms for heterogeneous networks of workstations
Journal of Parallel and Distributed Computing - Special issue on cluster and network-based computing
Adaptive Scheduling for Master-Worker Applications on the Computational Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
A World Wide Number Field Sieve Factoring Record: On to 512 Bits
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Master-Slave Paradigm with Heterogeneous Processors
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Scheduling Multi-Component Applications in Heterogeneous Wide-Area Networks
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
An Enabling Framework for Master-Worker Applications on the Computational Grid
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Scheduling Algorithms for Efficient Gather Operations in Distributed Heterogeneous Systems
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Efficient Collective Communication in Distributed Heterogeneous Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Adaptive scheduling of master/worker applications on distributed computational resources
Adaptive scheduling of master/worker applications on distributed computational resources
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
IEEE Transactions on Parallel and Distributed Systems
Load-balancing scatter operations for grid computing
Parallel Computing
Adaptive Allocation of Independent Tasks to Maximize Throughput
IEEE Transactions on Parallel and Distributed Systems
Improving Metaheuristics for Mapping Independent Tasks into Heterogeneous Memory-Constrained Systems
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
A dynamic task scheduling algorithm for grid computing system
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We show how to determine the optimal steady-state scheduling strategy for each processor.Because spanning trees are easier to deal with in practice, a natural question arises: how to extract the best spanning tree, i.e. the one with optimal steady-state throughput, out of a general interconnection graph? We show that this problem is NP-Complete. Still, we introduce and compare several low-complexity heuristics to determine a sub-optimal spanning tree.