This Article 
 Bibliographic References 
 Add to: 
Optimal Load Balancing in a Multiple Processor System with Many Job Classes
May 1985 (vol. 11 no. 5)
pp. 491-496
L.M. Ni, Department of Computer Science, Michigan State University
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.
Index Terms:
probabilistic scheduling, Job response time, job scheduling, load balancing, M/M/1 queue, multiple processor system, nonlinear programming
L.M. Ni, null Kai Hwang, "Optimal Load Balancing in a Multiple Processor System with Many Job Classes," IEEE Transactions on Software Engineering, vol. 11, no. 5, pp. 491-496, May 1985, doi:10.1109/TSE.1985.232489
Usage of this product signifies your acceptance of the Terms of Use.