Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload
IEEE Transactions on Parallel and Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
The Journal of Supercomputing
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Multiple Job Scheduling in a Connection-Limited Data Parallel System
IEEE Transactions on Parallel and Distributed Systems
A Parallel Computational Model for Heterogeneous Clusters
IEEE Transactions on Parallel and Distributed Systems
Divisible Load Scheduling and Markov Chain Models
Computers & Mathematics with Applications
Grid scheduling divisible loads from two sources
Computers & Mathematics with Applications
FIFO scheduling of divisible loads with return messages under the one-port model
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A methodology for dynamic scheduling of divisible workloads in grid environments
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Greedy "exploitation" is close to optimal on node-heterogeneous clusters
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Scheduling divisible loads with return messages on heterogeneous master-worker platforms
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Master-slave tasking on asymmetric networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A-FAST: autonomous flow approach to scheduling tasks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Multi-source task scheduling in grid computing environment using linear programming
International Journal of Computational Science and Engineering
| Hi-index | 0.00 |
We craft protocols for solving two problems related to sharing a large partitionable bag-of-tasks workload in a heterogeneous network of workstations (NOW) N. In the NOW-Rental Problem, one must complete W units of work and wishes to "rent" N for as short a time as necessary. In the NOW-Exploitation Problem, one has access to N for L time units and wishes to accomplish as much work as possible. Our protocols are crafted within an architectural model that characterizes N via parameters that measure its workstations' computational and communicational efficiencies; hence, our solutions are robust across a broad range of actual NOWs. The protocols determine both an allocation of work for each of N's workstations and a schedule for transmitting that work; hence, they are self-scheduling. The schedules provide a value for either L or W, given the other, thereby solving both motivating problems. By studying two specific protocols, we prove that the intuitive strategy of supplying as much work as possible to faster workstations is not optimal; this nonoptimality is often discernible for values of L less than one minute.