On multicast wormhole routing in multicomputer networks

Abstract

We show that deadlocks due to dependencies on consumption channels is a fundamental problem in mul ticast wormhole routing This issue of deadlocks has not been addressed in many previously proposed multicast algo rithms We also show that deadlocks on consumption chan nels can be avoided by using multiple classes of consump tion channels and restricting the use of consumption chan nels by multicast messages In addition we present a new multicast routing algorithm column path which uses the well known e cube algorithm for multicast routing There fore this algorithm could be implemented in the existing multicomputers with minimal hardware support We present a simulation study of the performance of Hamilton path based multicast algorithms with the proposed column path algorithm Our simulations indicate that the simplistic scheme of sending one copy of a multicast message to each of its destinations exhibits good performance and that the new column path algorithm o ers higher throughput com pared to the Hamilton path based algorithms

DOI: 10.1109/SPDP.1994.346103

Extracted Key Phrases

Statistics

0102030'95'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

87 Citations

Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Boppana1994OnMW, title={On multicast wormhole routing in multicomputer networks}, author={Rajendra V. Boppana and Suresh Chalasani and Cauligi S. Raghavendra}, booktitle={SPDP}, year={1994} }