Towards scalable collective communication for multicomputer interconnection networks

A. Y. Al-Dubai, M. Ould-Khaoua, K. El-Zayyat, I. Ababneh, S. Al-Dobai

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A considerable number of broadcast algorithms have been proposed for the mesh over the past decade. Nonetheless, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot efficiently support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this paper proposes the Nearest Side First Algorithm (or NSF for short) as a new adaptive broadcast algorithm for the mesh. One of the key results is that the performance of the NSF algorithm scales up well with the increase of processing elements, a feature not demonstrated by any previous broadcast algorithms, which enables the proposed algorithm to utilise massive parallel architectures with maximum effectiveness.

Original languageEnglish
Pages (from-to)293-310
Number of pages18
JournalInformation Sciences
Volume163
Issue number4
DOIs
Publication statusPublished - Jun 18 2004

Keywords

  • Broadcast latency
  • Collective communication
  • Interconnection networks
  • Mesh
  • Simulation
  • Wormhole routing

ASJC Scopus subject areas

  • Statistics and Probability
  • Electrical and Electronic Engineering
  • Statistics, Probability and Uncertainty
  • Information Systems and Management
  • Information Systems
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Towards scalable collective communication for multicomputer interconnection networks'. Together they form a unique fingerprint.

  • Cite this