This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
May 1979 (vol. 28 no. 5)
pp. 354-361
null Yuan-Chieh Chow, Department of Computer Science, Wright State University
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 among the processors. In each case an arriving job is routed by a job dispatcher to one of m parallel processors. The job routing strategies are divided into two classes: deterministic and nondeterministic. The nondeterministic policies are described by state independent branching probabilities. For the deterministic policies, the next processor is chosen to minimize or maximize the expected value of a performance related criterion function.
Index Terms:
queueing models., Job routing, load balancing, multiple processor system, performance analysis
Citation:
null Yuan-Chieh Chow, W.H. Kohler, "Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System," IEEE Transactions on Computers, vol. 28, no. 5, pp. 354-361, May 1979, doi:10.1109/TC.1979.1675365
Usage of this product signifies your acceptance of the Terms of Use.