A new polynomial-time algorithm for linear programming
Combinatorica
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
Introduction to algorithms
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Constant queue routing on a mesh
Journal of Parallel and Distributed Computing
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Information Processing Letters
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements
IEEE Transactions on Parallel and Distributed Systems
Optimal Routing Algorithms for Mesh-Connected Processor Arrays
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Routing and Sorting on Mesh-Connected Arrays
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multistage off-line permutation packet routing on a mesh: an approach with elementary mathematics
Journal of Computer Science and Technology
| Hi-index | 14.98 |
In this paper we present the multistage off-line method, a new and rather natural way to model off-line packet routing problems, which reduces the problem of off-line packet routing to that of finding edge disjoint paths on a multistage graph. The multistage off-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any processor. The paths for the packets are computed by a greedy heuristic method. Based on the multistage off-line method, we study the permutation packet routing problem on two-dimensional meshes. We ran millions of experiments based on random generated data and, for all of our experiments, we were able to compute a solution of length equal to the maximum distance a packet had to travel, and thus, match the actual lower bound for each routing pattern.