Efficient multiple multicasting in hypercubes

Hong Shen

Research output: Contribution to journalLetterpeer-review

11 Citations (Scopus)


Given k sets of processors (k > 1), G1, G2,..., Gk, each with a unique source, multiple multicasting requires to send message from each source to all the processors in its set. This problem can be solved by calling a (unique) multicasting algorithm k times, each for one set of processors, which requires a total time of O(knN) in a hypercube of N = 2n processors with existing hypercube multicasting algorithms. This paper proposes an efficient algorithm of time complexity O(nN) for solving this problem in the hypercube when Σk i=1 |Gi| = O(N). The algorithm is designed with the heuristics to minimize the maximum number of hops, amount of traffic and degree of message multiplexing. Experimental results show that the algorithm has a good performance and produces satisfactory multicasting layout.

Original languageEnglish
Pages (from-to)655-662
Number of pages8
JournalJournal of Systems Architecture
Issue number9
Publication statusPublished - Aug 1997
Externally publishedYes


  • Hypercubes
  • Multiple multicasting


Dive into the research topics of 'Efficient multiple multicasting in hypercubes'. Together they form a unique fingerprint.

Cite this