L. M. Ni
Abstract
A loosely coupled multiprocessor system contains multiple processors which have their own local memories. To balance the load among multiple processors is of fundamental importance in enhancing the performance of such a multiple processor system. Probabilistic load balancing in a heterogeneous multiple processor system with many job classes is considered in this study. The load balancing scheme is formulated as a nonlinear programming problem with linear constraints. An optimal probabilistic load balancing algorithm is proposed to solve this nonlinear programming problem. The proposed load balancing method is proven globally optimum in the sense that it results in a minimum overall average job response time on a probabilistic basis.
Recommendations
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
Queueing models for a simple heterogeneous multiple processor system are presented, analyzed, and compared. Each model is distinguished by a job routing strategy which is designed to reduce the average job turnaround time by balancing the total load ...
Efficient job scheduling in a mesh multicomputer without discrimination against large jobs
SPDP '95: Proceedings of the 7th IEEE Symposium on Parallel and Distributeed ProcessingMany innovative schemes for allocating jobs to parallel computing systems have been proposed in order to achieve highly utilized parallel computing systems. The schemes have tried to achieve good job response times with little system fragmentation of ...
Improved Strategies for Dynamic Load Balancing
This article investigates load balancing in highly dynamic local area networks connecting computers of different speeds. Most dynamic load-balancing techniques ignore the lag time in load-information update, and dispatch jobs immediately upon arrival ...
Comments