Title :
A load balancing algorithm for binary de Bruijn networks
Author :
Joshi, Bharat S. ; Kimm, Haklin
Author_Institution :
Dept. of Math. & Comput. Sci., Western Carolina Univ., Cullowhee, NC, USA
Abstract :
Load balancing is the process of improving the performance of a system through a redistribution of loads among the processors. In this paper we propose a load balancing scheme for binary de Bruijn networks. Binary de Bruijn networks have interesting properties. Some of these are logarithmic diameter, simple routing algorithms, fault tolerance, and important topologies such as binary tree are subnetworks
Keywords :
graph colouring; multiprocessor interconnection networks; processor scheduling; resource allocation; binary de Bruijn networks; binary tree; fault tolerance; load balancing algorithm; load redistribution; logarithmic diameter; simple routing algorithms; topologies; Binary trees; Computer science; Hardware; Load management; Mathematics; Modeling; Network topology; Performance analysis; Routing; Software algorithms;
Conference_Titel :
System Theory, 1998. Proceedings of the Thirtieth Southeastern Symposium on
Conference_Location :
Morgantown, WV
Print_ISBN :
0-7803-4547-9
DOI :
10.1109/SSST.1998.660130