New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n × n array, one algorithm runs in the optimal 2 · n - 2 steps, with maximum queue length 32. Another algorithm runs in near-optimal time, 2 · n + script O sign(1) steps, with a maximum queue length of only 12.
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics