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.
|Number of pages
|Published - 1996
|Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
Duration: 12 Jun 1996 → 14 Jun 1996
|Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
|12/06/96 → 14/06/96