Perfect load balancing on the star interconnection network
- First Online:
- 40 Downloads
In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n+1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n2−3n+0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general. Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms.
KeywordsMulticomputers Interconnection networks Star graph Load balancing Hierarchical algorithm Tree embedding
Unable to display preview. Download preview PDF.
- 2.Akers SB, Harel D, Krishnamurthy B (1987) The star graph: an attractive alternative to the n-cube. In: Proc international conference on parallel processing, pp 393–400 Google Scholar
- 4.Berenbrink P, Friedetzky T, Martin RA (2005) Dynamic diffusion load balancing. In: ICALP, pp 1386–1398 Google Scholar
- 5.Berenbrink P, Friedetzky T, Zengjian H (2006) A new analytical method for parallel, diffusion-type load balancing. In: Parallel and distributed processing symposium, IPDPS, April 2006, 10 pp Google Scholar
- 9.Elsasser R, Monien B, Schamberger S (2004) Load balancing in dynamic networks. In: Parallel Architectures, Algorithms and Networks, 2004, pp 193–200 Google Scholar
- 12.Plaxton GC (1989) Load balancing, selection and sorting on the hypercube. In: Proc of the 1st ACM symposium on parallel algorithms and architectures, June 1989, pp 64–73 Google Scholar
- 18.Tseng YC, Sheu JP (1997) Toward optimal broadcast in a star graph using multiple spanning trees. IEEE Trans Comput 46(5) Google Scholar