A scalable multicast service for mesh networks

Author

Xu, Hong ; McKinley, Philip K. ; Ni, Lionel M.

Author_Institution

Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA

fYear

1992

fDate

19-21 Oct 1992

Firstpage

156

Lastpage

163

Abstract

The authors investigate the scalability of a multicast algorithm designed for wormhole-routed mesh networks. The algorithm, known as the U-mesh algorithm, is shown to scale well in four ways: with the dimension of the mesh, with the number of destinations, with the system size, and with the problem size. It is demonstrated that the only factor that affects the multicast latency is the number of destinations and that, for a given number of destinations, the number of time steps required to perform a multicast operation is minimal. Performance measurements of implementations on a 64-node nCUBE-2 and a 168-node Symult 2010 are given

Keywords

hypercube networks; performance evaluation; 168-node Symult 2010; 64-node nCUBE-2; U-mesh algorithm; multicast algorithm; performance measurements; scalable multicast service; time steps; wormhole-routed mesh networks; Algorithm design and analysis; Bandwidth; Computer architecture; Computer science; Concurrent computing; Delay; Measurement; Mesh networks; Multicast algorithms; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the

Conference_Location

McLean, VA

Print_ISBN

0-8186-2772-7

Type

conf

DOI

10.1109/FMPC.1992.234893

Filename

234893