Optimal Multinode Broadcast on a Mesh Connected Graph with Reduced Bufferization

摘要

An optimal all to all communication procedure for a mesh connected graph withwraparound is described. The procedure is based on a spanning tree method and uses a reduced bufferization space. A communication step is defined as the simultaneous send/receive of a data unit on each node on its 4 links. For the all to all procedure, each node must receive p squared minus 1 data if p squared is the total number of nodes in the mesh.