Issue No. 03 - March (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.210810
<p>Even though exact algorithms exist for permutation routine of n/sup 2/ messages on an*n mesh of processors which require constant size queues, the constants are very largeand the algorithms very complicated to implement. A novel, simple heuristic for the above problem is presented. It uses constant and very small size queues (size=2). For all the simulations run on randomly generated data, the number of routing steps that is required by the algorithm is almost equal to the maximum distance a packet has to travel. A pathological case is demonstrated where the routing takes more than the optimal, and itis proved that the upper bound on the number of required steps is O(n/sup 2/).Furthermore, it is shown that the heuristic routes in optimal time inversion, transposition,and rotations, three special routing problems that appear very often in the design ofparallel algorithms.</p>
Index Termsheuristic; permutation packet routing; meshes; low buffer requirements; exact algorithms;upper bound; optimal time inversion; transposition; parallel algorithms; packet switching;parallel algorithms; parallel architectures
F. Makedon and A. Symvonis, "An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 270-276, 1993.