Lower bounds on communication loads and optimal placements in torus networks

IEEE Transactions on Computers

Volumn 49, Issue 3, 2000, Pages 259-266

  Azizoglu, M Cemil ^a   Egecioglu, Ömer ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); INTERCONNECTION NETWORKS; TELECOMMUNICATION TRAFFIC;

TORUS NETWORKS;

COMPUTER NETWORKS;

EID: 0033733549     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.841129     Document Type: Article

References (15)

1. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, and B. Smith, "The Tera Computer System," ACM Supercomputing, 1990.
2. M.C. Azizoglu and O. 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.M. Bae and B. Bose, "Resource Placement in Torus-Based Networks," IEEE Trans. Computers, vol. 46, no. 10, pp. 1,083-1,092, 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, R. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of k-ary n-cubes," IEEE Trans. on Computers, vol. 44, no. 8, pp. 1,021-1,030, Aug. 1995.
7. Y-C. Tseng, T-H. Lin, S.K.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. Gerbessiotis and L.G. Valiant, "Direct Bulk-Synchronous Parallel Algorithms," J. Parallel and Distributed Computing, vol. 22, pp. 251-267, 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, 1990.