Sciweavers

IPPS
1998
IEEE

Lower Bounds on Communication Loads and Optimal Placements in Torus Networks

14 years 4 months ago
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulting in a degradation in network throughput. In a partially-populated network, processors are placed on a subset of available nodes, and a routing algorithm is specified among the processors. Analogous to multistage networks, it is desirable to have the total number of messages being routed through a particular edge increase at most linearly with the size of the placement on torus networks. Recently, Blaum, Bruck, Pifarr
M. Cemil Azizoglu, Ömer Egecioglu
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors M. Cemil Azizoglu, Ömer Egecioglu
Comments (0)