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
A unified approach to off-line permutation routing on parallel networks
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
IEEE Transactions on Computers
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements
IEEE Transactions on Parallel and Distributed Systems
An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Scheduling and routing of AMOs in an intelligent transport system
IEEE Transactions on Intelligent Transportation Systems
| Hi-index | 0.00 |
Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.