The grid
Future Generation Computer Systems - Special issue on metacomputing
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
A Resource Query Interface for Network-Aware Applications
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?"
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Scheduling divisible workloads on heterogeneous platforms
Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
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
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems
IEEE Transactions on Parallel and Distributed Systems
On performance analysis of heterogeneous parallel algorithms
Parallel Computing
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Scheduling divisible loads in the dynamic heterogeneous grid environment
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Divisible Load Scheduling and Markov Chain Models
Computers & Mathematics with Applications
Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Adaptive Allocation of Independent Tasks to Maximize Throughput
IEEE Transactions on Parallel and Distributed Systems
Maestro: a self-organizing peer-to-peer dataflow framework using reinforcement learning
Proceedings of the 18th ACM international symposium on High performance distributed computing
Liana: a decentralized load-dependent scheduler for performance-cost optimization of grid service
The Journal of Supercomputing
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Overlay network management for scheduling tasks on the grid
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Dynamic scheduling for heterogeneous Desktop Grids
Journal of Parallel and Distributed Computing
Centralized versus distributed schedulers for multiple bag-of-task applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A deadline and budget constrained scheduling algorithm for escience applications on data grids
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Exploiting replication and data reuse to efficiently schedule data-intensive applications on grids
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
A-FAST: autonomous flow approach to scheduling tasks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Task scheduling in budget-constrained cloud computing systems to maximise throughput
International Journal of Computational Science and Engineering
| 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 tree to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We define a base model, and show how to determine the maximum steady-state throughput of a node in the base model, assuming we already know the throughput of the subtrees rooted at the node's children. Thus, a bottom-up traversal of the tree determines the rate at which tasks can be processed in the full tree. The best allocation is bandwidth-centric: if enough bandwidth is available, then all nodes are kept busy; if bandwidth is limited, then tasks should be allocated only to the children which have sufficiently small communication times, regardless of their computation power.