Optimal Load Balancing in a Multiple Processor System with Many Job Classes

IEEE Transactions on Software Engineering

Volumn SE-11, Issue 5, 1985, Pages 491-496

  Ni, Lionel M ^a   Hwang, Kai ^b  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Job response time; job scheduling; load balancing; M M 1 queue; multiple processor system; nonlinear programming; probabilistic scheduling

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL PROGRAMMING, NONLINEAR; PROBABILITY - QUEUEING THEORY; SCHEDULING - OPTIMIZATION;

AVERAGE JOB RESPONSE TIME; JOB CLASSES; MULTIPLE PROCESSOR SYSTEM (MPS); OPTIMAL PROBABILISTIC LOAD BALANCING;

COMPUTER SYSTEMS, DIGITAL;

EID: 0022054806     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1985.232489     Document Type: Article

References (17)

1. A. K. Agrawala, S. K. Tripathi, and G. Ricart, “Adaptive routing using a virtual waiting time technique,” IEEE Trans. Software Eng., vol. SE-8, pp. 76–81, Jan. 1982.
2. M. Aoki, Introduction to Optimization Techniques. New York: Macmillan, 1971.
3. C. W. Brown and M. Schwartz, “Adaptive routing in centralized computer communication networks,” in Proc. IEEE Int. Conf. Commun., June 1975, pp. 12–16.
4. J. P. Buzen and P. P. S. Chen, “Optimal load balancing in memory hierarchies,” in Information Processing 74. New York: North-Holland, 1974, pp. 271–275.
5. D. G. Cantor and M. Gerla, “Optimal routing in a packet-switched computer network,” IEEE Trans. Comput., vol. C-23, pp. 1062–1069, Oct. 1974.
6. Y. C. Chow and W. H. Kohler, “Models for dynamic load balancing in a heterogeneous multiple processor system,” IEEE Trans. Comput., vol. C-28, pp. 354–361, May 1979.
7. P. H. Enslow, Jr., “What is a distributed data processing system?,” IEEE Comput. Mag., pp. 13–21, Jan. 1978.
8. L. Flatto, “Two parallel queues with equal servicing rates,” IBM Res. Rep. RC 5916, Mar. 1976.
9. G. J. Foschini, “On heavy traffic diffusion analysis and dynamic routing in packet switched networks,” in Computer Performance, K. M. Chandy and M. Reiser, Eds. New York: Elsevier, 1977, pp. 499–513.
10. M. Gerla and L. Kleinrock, “On the topological design of distributed computer networks,” IEEE Trans. Commun., vol. COM-25, pp. 48–60, Jan. 1977.
11. K. Hwang, B. W. Wah, F. A. Briggs, W. Croft, G. Goble, W. R. Simmons, and C. L. Coates, “UNIX networking and load balancing in Purdue Engineering Computer Network,” IEEE Comput. Mag., pp. 55–66, Apr. 1982.
12. K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
13. L. Kleinrock, Queueing Systems, Vol. 1: Theory; Vol. 2: Computer Applications. New York: Wiley, 1975.
14. D. G. Luenberger, Introduction to Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1973.
15. L. M. Ni and K. Abani, “Nonpreemptive load balancing in a class of local area networks,” in Proc. Comput. Networking Symp., Dec. 1981, pp. 113–118.
16. L. M. Ni and K. Hwang, “Optimal load balancing strategies for a multiple processor system,” in Proc. Int. Conf. Parallel Processing, Aug. 1981, pp. 362–367.
17. B. Noble and J.W. Daniel, Applied Linear Algebra, 2nd ed. Engle-wood Cliffs, NJ: Prentice-Hall, 1977.