๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Nen-Chung Wang; Tzung-Shi Chen; Chih-Ping Chu


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
677 KB
Volume
47
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 efficient dual-tree-based multicasting algorithm with optimum level-based destination-switch partition strategy on irregular switch-based networks. The dual-tree-based routing scheme supports adaptive, distributed, and deadlock-free multicast on switch-based networks with double channels. We first describe a dual-tree structure established, based on the concept of network partitioning, from the irregular networks and prove that the multicasting based on this structure is deadlock-free. Then, an efficient multicast routing algorithm with optimum level-based partition strategy is proposed. Finally, the experimental results are given to show that the multicast performance based on tree-based multicasting scheme can be promoted by the dual-tree-based multicasting scheme with optimum level-based destination-switch partition strategy.


๐Ÿ“œ SIMILAR VOLUMES


A dual-hamiltonian-path-based multicasti
โœ 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

Unicast-based multicast algorithm in wor
โœ 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