Optimal broadcast and summation in the LogP model
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Needed: a theoretical basis for heterogeneous parallel computing
Developing a computer science agenda for high-performance computing
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
LogP: a practical model of parallel computation
Communications of the ACM
In search of clusters (2nd ed.)
In search of clusters (2nd ed.)
Designing communication strategies for hetereogeneous parallel systems
Parallel Computing
Broadcast scheduling optimization for heterogeneous cluster systems
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Task Allocation on a Network of Processors
IEEE Transactions on Computers
A Case for NOW (Networks of Workstations)
IEEE Micro
IEEE Transactions on Parallel and Distributed Systems
HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?"
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Multicast on Irregular Switch-based Networks with Wormhole Routing
HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Adaptive Communication Algorithms for Distributed Heterogeneous Systems
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Reduction Optimization in Heterogeneous Cluster Environments
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Efficient Collective Communication in Distributed Heterogeneous Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
IEEE Transactions on Parallel and Distributed Systems
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
Xen and co.: communication-aware CPU scheduling for consolidated xen-based hosting platforms
Proceedings of the 3rd international conference on Virtual execution environments
The impact of heterogeneity on master-slave scheduling
Parallel Computing
Fault-aware grid scheduling using performance prediction by workload modeling
The Journal of Supercomputing
A parallel solution for scheduling of real time applications on grid environments
Future Generation Computer Systems
Energy-Aware Scheduling of Flow Applications on Master-Worker Platforms
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
The impact of heterogeneity on master-slave on-line scheduling
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Scheduling divisible loads with return messages on heterogeneous master-worker platforms
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Improving speedup and response times by replicating parallel programs on a SNOW
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Master-slave tasking on asymmetric networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.00 |
We prove that "FIFO" worksharing protocols provide asymptotically optimal solutions to a problem related to sharing a bag of identically complex tasks in a heterogeneous network of workstations (HNOW) n. In the HNOW-Exploitation Problem, one seeks to accomplish as much work as possible on n during a prespecified fixed period of L time units. The worksharing protocols we study are crafted within an architectural model that characterizes n via parameters that measure workstations' computational and communicational powers. The protocols are self-scheduling, in that they determine completely both an amount of work to allocate to each of n's workstations and a schedule for all related interworkstation communications. A protocol observes a FIFO regimen if it has n's workstations finish their assigned work, and return their results, in the same order in which they are supplied with their workloads. The optimality of FIFO protocols resides in the fact that they accomplish at least as much work as any other protocol during all sufficiently long worksharing episodes. Simulation experiments indicate that the superiority of FIFO protocols is often observed during worksharing episodes of only a few minutes' duration.