Tree-Based Multicasting in Wormhole-Routed Irregular Topologies

Authors

Ran Libeskind-Hadas, Harvey Mudd CollegeFollow
Dominic Mazzoni '99, Harvey Mudd College
Ranjith Rajagopalan '99, Harvey Mudd College

Student Co-author

HMC Undergraduate

Document Type

Conference Proceeding

Department

Computer Science (HMC), Mathematics (HMC)

Publication Date

1998

Abstract

A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number of destinations using only a single startup phase. In contrast to existing tree-based schemes, this algorithm applies to all interconnection topologies, requires only fixed-sized input buffers that are independent of maximum message length, and uses a single asynchronous flit replication mechanism. The theoretical basis of the technique used here is sufficiently general to develop other tree-based multicasting algorithms for regular and irregular topologies. Simulation results demonstrate that this tree-based algorithm provides a very promising means of achieving very low latency multicast.

Comments

Published in the proceedings of WORLDCOMP ( http://www.world-academy-of-science.org/ ) World Academy of Sciences, Las Vegas, USA.

Rights Information

© 1998 World Academy of Science

Recommended Citation

R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, “Tree-Based Multicasting in Wormhole-Routed Irregular Topologies,” Proceedings of the Merged 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing, April 1998, Orlando, Florida, pp. 244-249.