Optimal Broadcasting on the Star Graph

Victor E. Mendia, Dilip Sarkar

Research output: Contribution to journalArticlepeer-review

108 Scopus citations


Recently the star graph has been shown as an attractive alternative to the widely used n-cube. Like the n-cube, the star graph possesses rich structure and symmetry as well as fault-tolerant capabilities, but has a smaller diameter and degree. However, very few algorithms exist to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. In this paper, we propose an optimal algorithm for one-to-all broadcasting in the star graph. The algorithm can broadcast a message to N processors in O(log2N) time. The algorithm exploits the rich structure of the star graph and works by recursively partitioning the original star graph into smaller star graphs. In addition, we develop an optimal all-to-all broadcasting algorithm.

Original languageEnglish (US)
Pages (from-to)389-396
Number of pages8
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number4
StatePublished - Jul 1 1992

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Optimal Broadcasting on the Star Graph'. Together they form a unique fingerprint.

Cite this