Optimal broadcast and summation in the LogP model
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
LogP: a practical model of parallel computation
Communications of the ACM
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
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
| Hi-index | 0.00 |
We proved in [1] that "FIFO" worksharing protocols provide asymptotically optimal solutions to the HNOW-Exploitation Problem.In this problem, one has a bag oftasks, and one seeks to accomplish as much work as possibleon a heterogeneous network of workstations (HNOW)N during a prespecified fixed period.Our study proceededwithin a model that characterizes N via parametersthat measure workstations' computational and communicationalpowers.A worksharing protocol observes a FIFOregimen if it has N's workstations finish their assignedwork, and return their results, in the same order in whichthey are supplied with their work.The asymptotic optimalityof FIFO protocols resides in their accomplishing at leastas much work as any other protocol during sufficiently longworksharing periods.We perfrom a suite of simulation experiments that delimit the length of "sufficiently long."Weshow that, over a range of values of model parameters, thesuperiority of FIFO protocols is usually observed during quiteshort worksharing episodes, often in the range of a few minutes, and seldom more than a few hours.