Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Highly parallel computing (2nd ed.)
Highly parallel computing (2nd ed.)
TNet: A Reliable System Area Network
IEEE Micro
A Flexible ServerNet-Based Fault-Tolerant Architecture
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches
IEEE Transactions on Parallel and Distributed Systems
Performance Modeling of ServerNet™ SAN Topologies
The Journal of Supercomputing
High-Performance Routing in Networks of Workstations with Irregular Topology
IEEE Transactions on Parallel and Distributed Systems
On the Use of Virtual Channels in Networks of Workstations with Irregular Topology
IEEE Transactions on Parallel and Distributed Systems
Architectural Support for Efficient Multicasting in Irregular Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing
IEEE Transactions on Parallel and Distributed Systems
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources
IEEE Transactions on Parallel and Distributed Systems
A Cost-Effective Approach to Deadlock Handling in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Boosting the Performance of Myrinet Networks
IEEE Transactions on Parallel and Distributed Systems
Dual-tree-based multicasting on wormhole-routed irregular switch-based networks
Journal of Systems Architecture: the EUROMICRO Journal
Boosting the Performance of Myrinet Networks
IEEE Transactions on Parallel and Distributed Systems
Maximum Delivery Time and Hot Spots in ServerNet(tm) Topologies
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Simple Incremental Network Topology for Wormhole Switch-Based Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Multicasting on Switch-Based Irregular Networks Using Multi-drop Path-Based Multidestination Worms
PCRCW '97 Proceedings of the Second International Workshop on Parallel Computer Routing and Communication
Improving the Performance of Regular Networks with Source Routing
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
The Effect of the Router Arbitration Policy on the Scalability of ServerNet(tm) Topologies
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
Efficient Multiple Multicast on Heterogeneous Network of Workstations
The Journal of Supercomputing
The Journal of Supercomputing
Efficient broadcast in heterogeneous networks of workstations using two sub-networks
International Journal of Parallel Programming
An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks
The Journal of Supercomputing
Designing efficient irregular networks for heterogeneous systems-on-chip
Journal of Systems Architecture: the EUROMICRO Journal
A general methodology for direction-based irregular routing algorithms
Journal of Parallel and Distributed Computing
An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Optimizing router arbitration in point-to-point networks
Computer Communications
Hi-index | 0.00 |
This paper examines the problems of deadlock avoidance in multistage networks, and proposes a new class of scalable topologies for constructing large networks without introducing loops that could cause deadlocks. The new topologies, called "fractahedrons," are deadlock-free and reduce the maximum link contention compared to other networks. The use of fractahedral topologies is illustrated by various configurations of 6-port ServerNet routers. The properties of fractahedral networks are compared with networks configured as a mesh, hypercube or fat tree.