Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
The connection machine
Sharp approximation models of adaptive routing in mesh networks (preliminary report)
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Interconnection Networks for Parallel and Distributed Processing
Interconnection Networks for Parallel and Distributed Processing
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Minimal adaptive routing on the mesh with bounded queue size
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Performance of hypercube routing schemes with or without buffering
IEEE/ACM Transactions on Networking (TON)
Potential function analysis of greedy hot-potato routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A performance model of deflection routing in multibuffer networks with nonuniform traffic
IEEE/ACM Transactions on Networking (TON)
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the stability of shuffle-exchange and bidirectional shuffle-exchange deflection networks
IEEE/ACM Transactions on Networking (TON)
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Randomized greedy hot-potato routing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
IEEE/ACM Transactions on Networking (TON)
Hot-potato routing on processor arrays
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Bounds on Maximum Delay in Networks with Deflection Routing
IEEE Transactions on Parallel and Distributed Systems
Hot-Potato Algorithms for Permutation Routing
IEEE Transactions on Parallel and Distributed Systems
Deterministic Many-to-Many Hot Potato Routing
IEEE Transactions on Parallel and Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Networks on which hot-potato routing does not livelock
Distributed Computing
The Data Vortex, an All Optical Path Multicomputer Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Formal validation of deadlock prevention in networks-on-chips
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Transforming behavioral specifications to facilitate synthesis of testable designs
ITC'94 Proceedings of the 1994 international conference on Test
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Potential Function Analysis of Greedy Hot-Potato Routing
Theory of Computing Systems
| Hi-index | 0.00 |
Upper bounds are given on the time T needed to evacuate k packets from a synchronous packet network using deflection routing, whereby all packets that arrive at a node during one time slot leave the node during the next slot. For example, T ≤ n + 2(k-1) for a binary n-cube network when priority is given to packets closer to their destination, and for a single destination network T is less than or equal to the network diameter plus k-1 times the network deflection index. Deflection routing for one pass through an omega network is also considered.