Fault-tolerant multicast with traffic-balancing in hypercubes

Research output: Contribution to conferencePaperpeer-review

1 Citation (Scopus)

Abstract

Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps a least possible amount of traffic, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity of O(nN) for fault-tolerant multicasting in a hyper-cube of N = 2 n processors containing an arbitrary number of faulty processors.

Original languageEnglish
Pages415-421
Number of pages7
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
Duration: 12 Jun 199614 Jun 1996

Conference

ConferenceProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
CityBeijing, China
Period12/06/9614/06/96

Fingerprint

Dive into the research topics of 'Fault-tolerant multicast with traffic-balancing in hypercubes'. Together they form a unique fingerprint.

Cite this