A case for on-machine load balancing

作者：Ali Shoukat^*; Eslamnour Behdis; Shah Zehra

来源：Journal of Parallel and Distributed Computing, 2011, 71(4): 556-564.

DOI：10.1016/j.jpdc.2010.11.003

• Load balancing and task assignment
• Application studies resulting in better multiple-processor systems
• Measurement, evaluation, modeling, simulation of multiple-processor systems
• Resource allocation

This paper diverges from the traditional load balancing, and introduces a new principle called the on-machine load balance rule. The on-machine load balance rule leads to resource allocations that are better in tolerating uncertainties in the processing times of the tasks allocated to the resources when compared to other resource allocations that are derived using the conventional "across-the-machines" load balancing rule. The on-machine load balance rule calls for the resource allocation algorithms to allocate similarly sized tasks on a machine (in addition to optimizing some primary performance measures such as estimated makespan and average response time). The on-machine load balance rule is very different from the usual across-the-machines load balance rule that strives to balance load across resources so that all resources have similar finishing times.
We give a mathematical justification for the on-machine load balance rule requiring only liberal assumptions about task processing times. Then we validate with extensive simulations that the resource allocations derived using on-machine load balance rule are indeed more tolerant of uncertain task processing times.

• 出版日期2011-4
• 单位IBM