Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Multi-packet-routing on mesh connected arrays
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A bridging model for parallel computation
Communications of the ACM
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast algorithms for bit-serial routing on a hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The fat-pyramid: a robust network for parallel computation
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
The network architecture of the Connection Machine CM-5 (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay
IEEE Transactions on Computers
Efficient communication schemes for massively parallel computers
Efficient communication schemes for massively parallel computers
A performance study of wormhole routed networks through analytical modeling and experimentation
A performance study of wormhole routed networks through analytical modeling and experimentation
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
Packet routing in networks with long wires
Journal of Parallel and Distributed Computing
A Theory of Wormhole Routing in Parallel Computers
IEEE Transactions on Computers
Sorting on a mesh-connected parallel computer
Communications of the ACM
A Thory of Fault-Tolerant routing in Wormhole Networks
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
A Critique of Adaptive Routing
A Critique of Adaptive Routing
A Framework for Adaptive Routing in Multicomputer Networks
A Framework for Adaptive Routing in Multicomputer Networks
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees
ICPP '97 Proceedings of the international Conference on Parallel Processing
Topology aware task mapping techniques: an api and case study
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
A Case Study of Communication Optimizations on 3D Mesh Interconnects
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
In this paper, we examine the wormhole routing problem in terms of the "congestion" c and "dilation" d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in $O\left( {cd\eta +cL\eta \,\,{\rm log}\,\,P} \right)$ time with high probability, where L is the number of flits in a packet, and 驴 = min{d, L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat-tree network of area 驴(A) can simulate wormhole routing on any network of comparable area with O(log3A) slowdown, when all worms have the same length. Variable-length worms are also considered. We run some simulations on the fat-tree which show that not only does wormhole routing tend to perform better than the more heavily studied store-and-forward routing in this context, but that performance superior to our provable bound is attainable in practice.