Off-line routing with small queues on a mesh-connected processor array

Presents efficient and simple algorithm for offline routing that uses very small queues. Our main result is that there exists an off-line algorithm for permutation routing on the n×n mesh-connected processor array, that takes 2.2 n+5 steps, and uses queues of size not more than 14. The algorithm uses novel and interesting techniques, and the bound on the queue size is smaller than those of known algorithms with the same time complexity