✦ LIBER ✦

Multicast Algorithms for Hypercube Multiprocessors

✍ Scribed by Shih-Hsien Sheu; Chang-Biau Yang

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 266 KB
Volume: 61
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.2000.1668

No coin nor oath required. For personal study only.

✦ Synopsis

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffic of multicast in hypercube multiprocessors. We propose three heuristic algorithms for the three problem models. Our multicast path algorithm is distributed, our Steiner tree algorithm is centralized, and our multicast tree algorithm is hybrid. Compared with the previous results by simulation, each of our heuristic algorithms improves the communication traffic in the corresponding multicast problem model.

📜 SIMILAR VOLUMES

Vision algorithms for hypercube machines

✍ T.N. Mudge; T.S. Abdel-Rahman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 926 KB

Hypercube algorithms for operations on q

Hypercube algorithms for operations on quadtrees

✍ Ravi V. Shankar; Sanjay Ranka 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Parallel sorting algorithms for tightly

Parallel sorting algorithms for tightly coupled multiprocessors

✍ Michael J. Quinn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Algorithms for delay constrained group m

Algorithms for delay constrained group multicast routing

✍ Kun-Cheng Tsai; Chyouhwa Chen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 1023 KB

Numerical algorithms for the hypercube c

Numerical algorithms for the hypercube concurrent processor

✍ Jean E. Patterson; Farzin Manshadi; Ruel H. Calalo; Paulett C. Liewer; William A 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 270 KB

With the development of concurrent computing architectures which promise cost-effective means of obtaining supercomputing performance, there is much interest in applying and in evaluating the actual performance on large, computationally-intensive problems. Of particular interest is the concurrent pe

Probabilistic system-level fault diagnos

Probabilistic system-level fault diagnostic algorithms for multiprocessors

✍ Tamás Bartha; Endre Selényi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 914 KB

Massively parallel computers (MPCs) introduce new requirements for system-level fault diagnosis, like handling a huge number of processing elements in a heterogeneous system. They also have specific attributes, such as regular topology and low local complexity. Traditional deterministic methods of s