Mesh permutation routing with locality

DOI10.1016/0020-0190(92)90019-RzbMath0772.68045OpenAlexW1992707473MaRDI QIDQ1199943

S. Singh

Publication date: 17 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90019-r

zbMATH Keywords

permutation routingmesh-connected arrays\(k-k\) routing with locality

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (2)

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Analysis of permutation routing algorithms

Cites Work

• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
• Unnamed Item
• Unnamed Item

This page was built for publication: Mesh permutation routing with locality