✦ LIBER ✦

Efficient path-based multicast in wormhole-routed mesh networks

✍ Scribed by Tzung-Shi Chen; Chih-Yung Chang; Jang-Ping Sheu

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 442 KB
Volume: 46
Category: Article
ISSN: 1383-7621
DOI: 10.1016/s1383-7621(99)00049-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strategies for Path-Based Multicasting i

Strategies for Path-Based Multicasting in Wormhole-Routed Meshes

✍ Eric Fleury; Pierre Fraigniaud 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 968 KB

Unicast-based multicast algorithm in wor

Unicast-based multicast algorithm in wormhole-routed star graph interconnection networks

✍ Jelena Mišić 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 266 KB

A contention-free unicast-based multicast algorithm is developed for wormhole-routed star graph interconnection networks. Since the size of the buffers in the wormhole routing controller is much smaller than the size of the message, only destination nodes of multicast should receive message and stor

A dual-hamiltonian-path-based multicasti

A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks

✍ Nen-Chung Wang; Chih-Ping Chu; Tzung-Shi Chen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercu

Dual-tree-based multicasting on wormhole

Dual-tree-based multicasting on wormhole-routed irregular switch-based networks

✍ Nen-Chung Wang; Tzung-Shi Chen; Chih-Ping Chu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 677 KB

Recently, network of workstations (NOWs) is emerging as an inexpensive alternative to massively parallel processors (MPPs). The irregular switch-based networks are proposed to build NOWs for high performance parallel computing. In this paper, we address a dual-tree-based routing model and propose an

YOMNA – An efficient deadlock-free multi

YOMNA – An efficient deadlock-free multicast wormhole algorithm in 2-D mesh multicomputers

✍ H. Moharam; M.A. Abd El-Baky; S.M.M. Nassar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Efficient Deadlock-Free Wormhole Routing

Efficient Deadlock-Free Wormhole Routing and Virtual-Channel Reduction in Shuffle-Based Networks

✍ Hyunmin Park; Dharma P. Agrawal 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 401 KB

Many aspects of shuffle-based networks have recently been studied by numerous researchers. However, no attention has been paid to deadlock-free wormhole routing algorithms. In this paper, for a set of shuffle-based networks, we introduce a graph-partitioning technique that enables a deadlock-free ro