Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Performance of the Direct Binary n-Cube Network for Multiprocessors
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Performance of multicomputer networks under Pin-out constraints
Journal of Parallel and Distributed Computing
Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer
IEEE Transactions on Computers
The Manhattan Street Network: a high performance, highly reliable metropolitan area network
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
Horizons of parallel computation
Journal of Parallel and Distributed Computing
Binary addressing and routing schemes in the Manhattan street network
IEEE/ACM Transactions on Networking (TON)
High performance computing: challenges for future systems
High performance computing: challenges for future systems
IEEE Transactions on Parallel and Distributed Systems
ICS '90 Proceedings of the 4th international conference on Supercomputing
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Pruned three-dimensional toroidal networks
Information Processing Letters
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus
IEEE Transactions on Computers
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes
ICPP '97 Proceedings of the international Conference on Parallel Processing
Multidimensional Network Performance with Unidirectional Links
ICPP '97 Proceedings of the international Conference on Parallel Processing
A TeraFLOP Supercomputer in 1996: The ASCI TFLOP System
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The Impact of Wiring Constraints on Hierarchical Network Performance
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Three-Dimensional Network Topologies
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Incomplete k-ary n-cube and its derivatives
Journal of Parallel and Distributed Computing
Communication Structures for Large Networks of Microcomputers
IEEE Transactions on Computers
Information Processing Letters
Hi-index | 0.98 |
The relative communication performance of low- versus high-dimensional torus networks (k-ary n-cubes) has been extensively studied under various assumptions about communication patterns and technological constraints. In this paper, we extend the comparison to torus networks with incomplete, but regular, connectivities. Taking an nD torus as the basis, we show that a simple pruning scheme can be used to reduce the node degree from 2n to 4, while preserving many of the desirable properties of the intact network. Orienting the torus links (removing half of the channels) provides a second form of pruning that leads to (multidimensional) Manhattan street networks. Finally, combined pruning and orientation yields the fourth class of toroidal networks studied here. We compare the static performance parameters of these networks and evaluate their dynamic communication performance under the assumptions of virtual cut-through switching and constant pin count. The 3D case, leading to networks that are efficiently realizable with current technology, is used to demonstrate and quantify the performance benefits. Our results reinforce, extend, and complement previous studies that have demonstrated the performance advantages of low-dimensional k-ary n-cubes over higher-dimensional ones. For example pruned 3D tori provide additional design points that fall between 2D and 3D tori in terms of implementation complexity but can outperform both of these standard architectures. Thus, from a practical standpoint, pruning introduces additional flexibility in implementation options and trade-offs available to designers.