Deterministic Permutation Routing on Meshes

New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On ann×narray, one algorithm runs in the optimal 2·n−2 steps, with maximum queue length 32. Another algorithm runs in near-optimal time, 2·n+O(1) steps, with a maximum queue length of only 12.

Saved in:
Bibliographic Details
Published inJournal of algorithms Vol. 22; no. 1; pp. 111 - 141
Main Authors Sibeyn, Jop F., Chlebus, Bogdan S., Kaufmann, Michael
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 01.01.1997
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Deterministic automaton
Queue length
Optimal algorithm
Permutation
Parallel algorithms
Online AccessGet full text
ISSN0196-6774
1090-2678
DOI10.1006/jagm.1995.0804

Cover

More Information
Summary:New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On ann×narray, one algorithm runs in the optimal 2·n−2 steps, with maximum queue length 32. Another algorithm runs in near-optimal time, 2·n+O(1) steps, with a maximum queue length of only 12.
ISSN:0196-6774
1090-2678
DOI:10.1006/jagm.1995.0804