Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job

IEEE Transactions on Computers

Volumn 43, Issue 10, 1994, Pages 1184-1196

  Hsiung, Te Yu ^b   Robertazzi, Thomas G ^b  

^a JORDAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Jordan)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

divisible job; load balancing; Load sharing; multiprocessors

Indexed keywords

COMPUTER NETWORKS; COMPUTER SIMULATION; COMPUTERS; DATA PROCESSING; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; OPTIMAL CONTROL SYSTEMS; PERFORMANCE; RECURSIVE FUNCTIONS; TIMING CIRCUITS;

BUS NETWORK; DIVISIBLE JOB; LOAD BALANCING; LOAD SHARING; OPTIMAL LOAD ALLOCATION; PROCESSOR; TREE NETWORK;

TIME SHARING SYSTEMS;

EID: 0028518217     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.324544     Document Type: Article

References (21)

1. Y. C. Cheng and T. G. Robertazzi, “Distributed computation with communication delays,” IEEE Trans. Aerospace and Electron. Syst., vol. 24, no. 6, pp. 700-712, Nov. 1988.
2. “Distributed computation for tree network with communication delays,” IEEE Trans. Aerospace and Syst., vol. 26, no. 3, pp. 511-516, May 1990.
3. S. Bataineh and T. G. Robertazzi, “Distributed computation for a bus networks with communication delays,” in Proc. 1991 Conf. Inform. Sci. Syst., The Johns Hopkins Univ., Baltimore MD, Mar. 1991, pp. 709-714.
4. “Bus oriented load sharing for a network of sensor driven processors,” IEEE Trans. Syst., Man Cybern., vol. 21, no. 5, pp. 1202-1205, Sept. 1991.
5. T. Hsiung and T. G. Robertazzi, “Performance evaluation for distributed communication systems for load balancing,” Technical Report no. 612, SUNY at Stony Brook, College of Eng. and Appl. Sci., Dec. 17, 1991 (available from T. Robertazzi).
6. K. M. Baumgartner and B. W. Wah, “GAMMON: A load balancing strategy for local computer systems with multiaccess networks,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1098-1109, Aug. 1989.
7. S. H. Bokhari, Assignment Problems in Parallel and Distributed Computing. Boston: Kluwer Academic, 1987.
8. V. M. Lo, “Heuristic algorithms for task assignment in distributed systems,” IEEE Trans. Comput., vol. 37, no. 11, pp. 1384-1397, Nov. 1988.
9. K. Ramamritham, J. A. Stankovic, and W. Zhao, “Distributed scheduling of tasks with deadlines and resources requirements,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1110-1122, Aug. 1989.
10. K. G. Shin and Y.-C. Chang, “Load sharing in distributed Real time systems with state change broadcasts,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1124-1142, Aug. 1989.
11. H. S. Stone, “Multiprocessor scheduling with the aid of network flow algorithms,” IEEE Trans. Software Eng., vol. SE-3, no. 1, pp. 85-93, Jan. 1977.
12. R. Mirchandaney, D. Towsley, and J. A. Stankovic, “Analysis of the effects of delays on the load sharing,” IEEE Trans. Comput., vol. 38, no. 11, pp. 1513-1525, Nov. 1989.
13. L. M. Ni and K. Hwang, “Optimal load balancing in a multiple processor system with many job classes,” IEEE Trans. Software Eng., vol. SE-11, no. 5, pp. 491-496, May 1985.
14. J. Sohn and T. G. Robertazzi, “Optimal load sharing for a divisible job on a bus network,” in Proc. 1993 Conf. Inform. Sci. Syst., The Johns Hopkins Univ., Baltimore MD, Mar. 1993.
15. V. Bharadwaj, D. Ghose, and V. Mani, “Design and analysis of load distribution strategies for infinitely divisible loads in distributed processing networks with communication delays,” Tech. Rep. 422-GC-01-92, Dept. of Aerospace Eng., Indian Inst. of Science, Bangalore, India, Oct. 1992.
16. “A study of optimality conditions for load distribution in tree networks with communication delays,” Tech. Rep. 423-GI-02-92, Dept. of Aerospace Eng., Indian Inst. of Science, Bangalore, India, Dec. 1992.
17. J. Du and J. Y.-T. Leung, “Complexity of scheduling parallel task systems,” SIAM J. Discrete Math., vol. 2, pp. 473-487, Nov. 1989.
18. J. Blazewicz, M. Drabowski, and J. Weglarz, “Scheduling multiprocessor tasks to minimize schedule length,” IEEE Trans. Comput., vol. C-35, pp. 389-393, May 1986.
19. W. Zhao, K. Ramamritham, and J. A. Stankovic, “Preemptive scheduling under time and resource constraints,” IEEE Trans. Comput., vol. C-36, pp. 949-960, Aug. 1987.
20. S. Bataineh and T. Robertazzi, “Ultimate performance limits for networks of load sharing processors,” in Proc. 1992 Conf. Inform. Sci. Syst., Princeton Univ., Princeton NJ, Mar. 1992, pp. 794-799.
21. H. J. Kim, G.-I. Jee and J. G. Lee, “Optimal load distribution for tree network processors,” submitted for publication.