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

  • Authors:

  • Basel A. Mahafzah;Bashira A. Jaradat

  • Affiliations:

  • Department of Computer Science, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan 11942;Department of Computer Science, King Hussein School for Information Technology, Princess Sumaya University for Technology, Amman, Jordan 11941

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.