Limits on interconnection network performance
Anant K. Agarwal · IEEE Transactions on Parallel and Distributed Systems · 1991
The latency of direct networks is modeled, taking into account both switch and wire delays. A simple closed-form expression for contention in buffered, direct networks is derived and found to agree closely with simulations. The model includes the effects of packet size and communication locality. Network analysis under various constraints and under different workload parameters reveals that performance is highly sensitive to these constraints and workloads. A two-dimensional network is shown to have the lowest latency only when switch delays and network contention are ignored; three- or four-dimensional networks are favored otherwise. If communication locality exists, two-dimensional networks regain their advantage. Communication locality decreases both the base network latency and the network bandwidth requirements of applications. It is shown that a much larger fraction of the resulting performance improvement arises from the reduction in bandwidth requirements than from the decrease in latency.>
Cited by 482 works. doi:10.1109/71.97897
Authors
References
- The Connection Machine
- The cosmic cube
- Virtual cut-through: A new computer communication switching technique
- Access and Alignment of Data in an Array Processor
- Theory, Volume 1, Queueing Systems
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
- A large scale, homogeneous, fully distributed parallel machine, I
- The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture.
- A Complexity Theory for VLSI
- Multicomputers: message-passing concurrent computers