TTPM - An efficient deadlock-free algorithm for multicast communication in 2D torus networks

  • Authors:

  • M. G. Darwish;A. A. Radwan;M. A. Abd El-Baky;K. Hamed

  • Affiliations:

  • Faculty of Computers and Information - Cairo University, Egypt;Department of Computer Science, Faculty of Science, Minia University, Egypt;Department of Mathematics and Computer, Faculty of Science, Fayum University, Egypt;Department of Mathematics and Computer, Faculty of Science, Fayum University, Egypt

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A torus network has become increasingly important to multicomputer design because of its many features including scalability, low bandwidth and fixed degree of nodes. A multicast communication is a significant operation in multicomputer systems and can be used to support several other collective communication operations. This paper presents an efficient algorithm, TTPM, to find a deadlock-free multicast wormhole routing in two-dimensional torus parallel machines. The introduced algorithm is designed such that messages can be sent to any number of destinations within two start-up communication phases; hence the name Torus Two Phase Multicast (TTPM) algorithm. An efficient routing function is developed and used as a basis for the introduced algorithm. Also, TTPM allows some intermediate nodes that are not in the destination set to perform multicast functions. This feature allows flexibility in multicast path selection and therefore improves the performance. Performance results of a simulation study on torus networks are discussed to compare TTPM algorithm with a previous algorithm.