Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks

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

Abstract

The Chained-Cubic Tree (CCT) interconnection network topology was recently proposed as a continuation for the extended efforts in the area of interconnection networks’ performance improvement. This topology, which promises to exhibit the best properties of the hypercube and tree topologies, needs to be deeply investigated in order to evaluate its performance among other interconnection networks’ topologies. This work comes as a complementary effort, in which the load balancing technique is investigated as one of the most important aspects of performance improvement. This paper proposes a new load balancing algorithm on CCT interconnection networks. The proposed algorithm, which is called Hybrid Dynamic Parallel Scheduling Algorithm (HD-PSA), is a combination of two common load balancing strategies; dynamic load balancing and parallel scheduling. The performance of the proposed algorithm is evaluated both, analytically and experimentally, in terms of various performance metrics; including, execution time, load balancing accuracy, communication cost, number of tasks hops, and tasks locality.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Abdullah M (2007) The chained-cubic tree: a new interconnection network. Master’s thesis, Department of Computer Science, Jordan University of Science and Technology, Irbid, Jordan

  2. Liu Y, Han J (2008) Double-loop hypercube: a new scalable interconnection network for massively parallel computing. In: ISECS international colloquium on computing, communication, control and management (CCCM), 2008, vol 1, pp 170–174

  3. Balkan A, Qu G, Vishkin U, (2008) An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. In: Proceedings of the 45th annual conference on design automation, California, 2008, pp 435–440

  4. Lee H-O, Kim J-S, Park K-W, Seo J, Oh E (2005) Matrix-star graphs: a new interconnection network based on matrix operations. In: Proceedings of the 10th Asia-Pacific conference, ACSAC, Singapore, 2005. Advances in computer systems architecture, Lecture notes in computer science, vol 3740. Springer, Berlin, pp 478–487

    Google Scholar 

  5. Shi W, Srimani P (2005) Hierarchical star: a new two level interconnection network. J Syst Archit 51(1):1–14

    Article  Google Scholar 

  6. Afroz N, Sinha B, Islam R, Banyopadhyay S (2004) A new network topology with multiple three-dimensional meshes. In: Proceedings of the 6th international workshop on distributed computing (IWDC), Kolkata, India, 2004. Lecture notes in computer science, vol 3326. Springer, Berlin, pp 379–384

    Google Scholar 

  7. Lee H-O, Kim J-S, Oh E, Lim H-S (2002) Hyper-star graph: A new interconnection network improving the network cost for the hypercube. In: Proceedings of the first EuroAsian conference on information and communication technology, Shiraz, Iran, 2002. Lecture notes in computer science, vol 2510. Springer, Berlin, pp 858–865

    Google Scholar 

  8. Ranka S, Won Y, Sahni S (1988) Programming a hypercube multicomputer. IEEE Softw 5(5):69–77

    Article  Google Scholar 

  9. Shu W, Wu M-Y (1995) An incremental parallel scheduling approach for solving dynamic and irregular problems. In: Proceedings of the 24th international conference on parallel processing, Oconomowoc, WI, 1995, pp 143–150

  10. Yao J, Veeravalli B (2004) Design and performance analysis of divisible load scheduling strategies on arbitrary graphs. Cluster Comput 7(2):191–207

    Article  Google Scholar 

  11. Jan G, Lin F, Lin M-B, Liang D (2002) Concentrations, load balancing, multicasting and partial permutation routing on hypercube parallel computers. J Inf Sci Eng 18(5):693–712

    Google Scholar 

  12. Jan G, Lin M-B (1994) Effective load balancing on highly parallel multicomputers based on superconcentrators. In: Proceedings of the 1994 international conference on parallel and distributed systems, Taiwan, 1994, pp 216–221

  13. Rim H, Jang J-W, Kim S (1999) An efficient dynamic load balancing using the dimension exchange method for balancing of quantized loads on hypercube multiprocessors. In: Proceedings of the 13th international parallel processing symposium and 10th symposium on parallel and distributed processing (IPPS/SPDP), Puerto Rico, 1999, pp 708–712

  14. Rim H, Jang J-W, Kim S (2003) A simple reduction of non-uniformity in dynamic load balancing of quantized loads on hypercube multiprocessors and hiding balancing overheads. J Comput Syst Sci 67(1):1–25

    Article  MATH  MathSciNet  Google Scholar 

  15. Jan G, Hwang Y-S (2003) An efficient algorithm for perfect load balancing on hypercube multiprocessors. J Supercomput 25(1):5–15

    Article  MATH  Google Scholar 

  16. Zhao C, Xiao W, Qin Y (2007) Hybrid diffusion schemes for load balancing on OTIS-Networks. In: Proceedings of the 7th international conference on algorithms and architectures for parallel processing (ICA3PP), China, 2007. Lecture notes in computer science, vol 4494. Springer, Berlin, pp 421–432

    Chapter  Google Scholar 

  17. Qin Y, Xiao W, Zhao C (2007) GDED-X Schemes for load balancing on heterogeneous OTIS-Networks. In: Proceedings of the 7th international conference on algorithms and architectures for parallel processing (ICA3PP), China, 2007. Lecture notes in computer science, vol 4494. Springer, Berlin, pp 482–492

    Chapter  Google Scholar 

  18. Mahafzah B, Jaradat B (2008) The load balancing problem in OTIS-Hypercube interconnection networks. J Supercomput 46(3):276–297

    Article  Google Scholar 

  19. Shu W, Wu M-Y (1996) Runtime incremental parallel scheduling (RIPS) on distributed memory computers. IEEE Trans Parallel Distrib Syst 7(6):637–649

    Article  Google Scholar 

  20. Wu M-Y (1997) On runtime parallel scheduling for processor load balancing. IEEE Trans Parallel Distrib Syst 8(2):173–186

    Article  Google Scholar 

  21. Wu M-Y, Shu W (1996) A load balancing algorithm for N-cubes. In: Proceedings of the 1996 international conference on parallel processing, 1996, vol 3, pp 148–155

  22. Mello R, Trevelin L, Paiva M, Yang L (2006) Comparative study of the server-initiated lowest algorithm using a load balancing index based on the process behavior for heterogeneous environment. Cluster Comput 9(3):313–319

    Article  Google Scholar 

  23. Zhuang Y-C, Liang T, Shieh C-K, Lee J-Q, Yang L (2004) A group-based load balance scheme for software distributed shared memory systems. J Supercomput 28(3):295–309

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Basel A. Mahafzah.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mahafzah, B.A., Jaradat, B.A. The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks. J Supercomput 52, 224–252 (2010). https://doi.org/10.1007/s11227-009-0288-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-009-0288-3

Keywords

Navigation