Proceedings of the Ninth IASTED International Conference on Parallel and Distributed Computing and Systems
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel computers. In addition, wormhole routing has increasingly been advocated as a method of reducing latency. Most analysis of wormhole routed networks, however, has focused on the torus and the broader class of k-ary n-cubes to which it belongs. This paper presents a performance model for the wormhole routed mesh, and it compares the performance of the mesh and torus based on theoretical and empirical analyses.
Ronald I. Greenberg and Lee Guan. Modeling and comparison of wormhole routed mesh and torus networks. In Proceedings of the Ninth IASTED International Conference on Parallel and Distributed Computing and Systems, pages 501--506, Washington, D. C., October 1997.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Presentation slides from Ninth IASTED International Conference on Parallel and Distributed Computing and Systems
Computer and Systems Architecture Commons, Other Operations Research, Systems Engineering and Industrial Engineering Commons, Theory and Algorithms Commons
© 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.