This Article 
 Bibliographic References 
 Add to: 
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks
March 2000 (vol. 49 no. 3)
pp. 259-266

Abstract—Fully populated torus-connected networks, 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 occupy a subset of available nodes and a routing algorithm is specified among the processors placed. Analogous to multistage networks, it is desirable to have the total number of messages being routed through a particular edge in toroidal networks increase at most linearly with the size of the placement. To this end, we consider placements of processors which are described by a given placement algorithm parameterized by $k$ and $d$: We show formally, that to achieve linear communication load in a $d$-dimensional $k$-torus, the number of processors in the placement must be equal to $c k^{d-1}$ for some constant $c$. Our approach also gives a tighter lower bound than existing bounds for the maximum load of a placement for arbitrary number of dimensions for placements with sufficient symmetries. Based on these results, we give optimal placements and corresponding routing algorithms achieving linear communication load in tori with arbitrary number of dimensions.

[1] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 1-6.
[2] M.C. Azizoglu and Ö. Egecioglu, “Lower Bounds on Communication Loads and Optimal Placements in Torus Networks,” Proc. IEEE 1998 Int'l Parallel Processing Symp./Symp. Parallel and Distributed Processing Symp., pp. 460–464, Mar. 1998.
[3] M. Bae and B. Bose, “Resource Placement in Torus-Based Networks,” IEEE Trans. Computers, vol. 46, no. 10, pp. 1083-1092, Oct. 1997.
[4] M. Blaum, J. Bruck, G.D. Pifarré, and J.L. Sanz., “On Optimal Placements of Processors in Tori Networks,” Proc. Eighth IEEE Symp. Parallel and Distributed Processing, pp. 552–555, Oct. 1996.
[5] M. Blaum, J. Bruck, G.D. Pifarré, and J.L. Sanz., “On Optimal Placements of Processors in Fault-Tolerant Tori Networks,” preprint, 1997.
[6] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of k-Ary n-Cubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,021-1,030, Aug. 1995.
[7] Y.-C. Tseng, T.-H. Lin, S. Gupta, and D.K. Panda, “Bandwidth-Optimal Complete Exchange on Wormhole Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 380-396, Apr. 1997.
[8] A.V. Gerbessiotis and L.G. Valiant, “Direct Bulk-Synchronous Parallel Algorithms,” J. Parallel and Distributed Computing, vol. 22, no. 2, pp. 251-267, Aug. 1994.
[9] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[10] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North Holland, 1977.
[11] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[12] F. Pitteli and D. Smitley, “Analysis of a 3D Toroidal Network for a Shared Memory architecture,” Proc. Supercomputing '88, pp. 35–41, Nov. 1988.
[13] S. Rao, T. Suel, T. Tsantilas, and M. Goudreau, “Efficient Communication Using Total Exchange,” Proc. Int'l Parallel Processing Symp.'95, pp. 544–550, 1995.
[14] J.F. Sibeyn, “Routing on Triangles, Tori and Honeycombs,” Int'l J. Foundations of Computer Science, vol. 8, no. 3, pp. 269–287, 1997.
[15] L.G. Valiant, “A Bridging Model for Parallel Computation,” Comm. ACM, vol. 33, no. 8, pp. 103-111, Aug. 1990.

Index Terms:
Torus, routing, placement, load, bisection, interconnection network, edge separator.
M. Cemil Azizoglu, Ömer Egecioglu, "Lower Bounds on Communication Loads and Optimal Placements in Torus Networks," IEEE Transactions on Computers, vol. 49, no. 3, pp. 259-266, March 2000, doi:10.1109/12.841129
Usage of this product signifies your acceptance of the Terms of Use.