Mesh permutation routing with locality

DOI10.1016/0020-0190(92)90019-RMaRDI QIDQ1199943zbMATH OpenOpenAlexFDO

Authors 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

\(k-k\) routing with localitymesh-connected arrayspermutation routing

Mathematics Subject Classification ID

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

Recommendations

• Deterministic Permutation Routing on Meshes
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• Analysis of permutation routing algorithms
• Optimal routing algorithms for mesh-connected processor arrays
• Shorter queues for permutation routing on meshes

Cites work

• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
• scientific article; zbMATH DE number 4147467 (Why is no real title available?)
• scientific article; zbMATH DE number 4049037 (Why is no real title available?)

Cited in

(7)

• Analysis of permutation routing algorithms
• Deterministic Permutation Routing on Meshes
• An optimal permutation routing algorithm on full-duplex hexagonal networks
• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
• PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
• Permutation routing on reconfigurable meshes
• Brief announcement: What can(not) be perfectly rerouted locally

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199943)