This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
October 1994 (vol. 43 no. 10)
pp. 1184-1196

Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.

[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] Y. C. Cheng and T. G. Robertazzi, "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," inProc. 1991 Conf. Inform. Sci. Syst., The Johns Hopkins Univ., Baltimore MD, Mar. 1991, pp. 709-714.
[4] S. Bataineh and T. G. Robertazzi, "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, MA: Kluwer Academic, 1987.
[8] V. M. Lo, "Heuristic algorithms for task assignment in distributed systems,"IEEE Trans. Comput., vol. 37, no. 11, 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." inProc. 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] V. Bharadwaj, D. Ghose, and V. Mani, "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. Disc. Math., vol. 2, no. 4, 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., Aug. 1987.
[20] S. Bataineh and T. Robertazzi, "Ultimate performance limits for networks of load sharing processors," inProc. 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.

Index Terms:
resource allocation; multiprocessor interconnection networks; system buses; closed form solutions; tree networks; bus networks; processors load sharing; optimal load allocation; front-end processors; optimal data allocation; symmetric tree networks.
Citation:
S. Bataineh, Te-Yu Hsiung, T.G. Robertazzi, "Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job," IEEE Transactions on Computers, vol. 43, no. 10, pp. 1184-1196, Oct. 1994, doi:10.1109/12.324544
Usage of this product signifies your acceptance of the Terms of Use.