COMPACT MULTICAST ALGORITHMS ON GRIDS AND TORI WITHOUT INTERMEDIATE BUFFERING

Abstract

We consider a communication model in which the intermediate nodes cannot store in-transit messages. Under this communication model we study the all-node multicast operation on multidimensional grids and tori. We derive optimal algorithms that are compactly described using a short sequence of node identities. This characteristic contributes to the simplicity of the router, the unit that resides at each processor and is dedicated to handle communication.