Skip to main content
SpringerLink
Log in

Perfect load balancing on the star interconnection network

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

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.25n 2−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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Al-Ayyoub A, Day K (2003) Node ranking schemes for the star networks. J Parallel Distrib Comput 63:239–250

    Article  MATH  Google Scholar 

  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

  3. Bagherzadeh N, Dowd M, Nassif N (1996) Embedding an arbitrary binary tree into the star graph. IEEE Trans Comput 45(4):475–481

    Article  MATH  Google Scholar 

  4. Berenbrink P, Friedetzky T, Martin RA (2005) Dynamic diffusion load balancing. In: ICALP, pp 1386–1398

  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

  6. Chen TS, Tseng YC, Sheu JP (1996) Balanced spanning trees in complete and incomplete star graphs. IEEE Trans Parallel Distrib Syst 7(7):717–723

    Article  Google Scholar 

  7. Chen TS, Wang NC (2005) Optimal broadcasting on incomplete star graph interconnection networks. J Syst Architect 51(2):143–150

    Article  Google Scholar 

  8. Elsässer R, Monien B, Preis R (2002) Diffusion schemes for load balancing on heterogeneous networks. Theory Comput Syst 35(3):305–320

    Article  MATH  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

  10. Jan GE, Hwang YS (2003) An efficient algorithm for perfect load balancing on hypercube multiprocessors. J Supercomput 25:5–15

    Article  MATH  Google Scholar 

  11. Jwo JS, Lakshmivarahan S, Dhall SK (1991) Embedding of cycles and grids in star graphs. J Circ Syst Comput 1(1):43–74

    Article  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

  13. Qiu K, Akl SG (1994) Load balancing, selection, and sorting on the star and pancake interconnection networks. Parallel Algorithm Appl 2:27–42

    MATH  Google Scholar 

  14. Rotaru T, Nägeli HH (2004) Dynamic load balancing by diffusion in heterogeneous systems. J Parallel Distrib Comput 64(4):481–497

    Article  MATH  Google Scholar 

  15. Sakia DK, Sen RK (1996) Two ranking schemes for efficient computation on the star interconnection network. IEEE Trans Parallel Distrib Syst 7(4):321–327

    Article  Google Scholar 

  16. Shi W, Srimani PK (2005) Leader election in hierarchical star network. J Parallel Distrib Comput 65(11):1435–1442

    Article  MATH  Google Scholar 

  17. Tseng CY, Chang SH, Sheu JP (1997) Fault-tolerant ring embedding in a star graph with both link and node failure. IEEE Trans Parallel Distrib Syst 8(12):1185–1195

    Article  Google Scholar 

  18. Tseng YC, Sheu JP (1997) Toward optimal broadcast in a star graph using multiple spanning trees. IEEE Trans Comput 46(5)

  19. Willebeek-LeMair MH, Reeves AP (1993) Strategies for dynamic load balancing on highly parallel computers. IEEE Trans Parallel Distrib Syst 4(9):979

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IPM School of Computer Science, Tehran, Iran

    N. Imani

  2. Sharif University of Technology & IPM, Azadi St., Tehran, Iran

    H. Sarbazi-Azad

  3. Queens University, Kingston, Ontario, Canada

    S. G. Akl

Authors
  1. N. Imani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Sarbazi-Azad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. G. Akl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. Sarbazi-Azad.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Imani, N., Sarbazi-Azad, H. & Akl, S.G. Perfect load balancing on the star interconnection network. J Supercomput 41, 269–286 (2007). https://doi.org/10.1007/s11227-007-0128-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-007-0128-2

Keywords

Search

Navigation