Abstract
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.
Original language | American English |
---|---|
Journal | Computer Science: Faculty Publications and Other Works |
DOIs | |
State | Published - Oct 1 1997 |
Keywords
- interconnection network
- wormhole routing
- latency
- throughput
- 2D-mesh
- torus
- queueing theory
Disciplines
- Computer and Systems Architecture
- Computer Sciences
- Other Operations Research, Systems Engineering and Industrial Engineering
- Theory and Algorithms