Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Optimal routing algorithms for mesh-connected processor arrays (extended abstract)
VLSI Algorithms and Architectures
Routing and sorting on mesh-connected arrays (extended abstract)
VLSI Algorithms and Architectures
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A 2n-2 step algorithm for routing in an nxn array with constant size queues
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Multi-packet-routing on mesh connected arrays
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Balanced routing: towards the distance bound on grids
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fully-adaptive routing: packet switching performance and wormhole algorithms
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for routing and sorting on multi-dimensional meshes
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Bounds on the greedy routing algorithm for array networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Minimal adaptive routing on the mesh with bounded queue size
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting
IEEE Transactions on Computers
IEEE Transactions on Computers
A Flexible Bit-Pattern Associative Router for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
A Theory of Wormhole Routing in Parallel Computers
IEEE Transactions on Computers
On the communication throughput of buffered multistage interconnection networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Constant time per edge is optimal on rooted tree networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy dynamic routing on arrays
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A wave-pipelined router architecture using ternary associative memory
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
A (2.954 + ε)n oblivious routing algorithm on 2D meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
A general approach to dynamic packet routing with bounded buffers
Journal of the ACM (JACM)
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Faster deterministic sorting through better sampling
Theoretical Computer Science
Constant time per edge is optimal on rooted tree networks
Distributed Computing
| Hi-index | 0.01 |