A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
From MaRDI portal
Publication:1899217
DOI10.1007/BF01294128zbMath0833.68058OpenAlexW2027063844MaRDI QIDQ1899217
Publication date: 18 March 1996
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01294128
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (11)
Optimal multi-packet routing on the torus ⋮ Efficient delay routing ⋮ Oblivious routing with limited buffer capacity ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ Randomized multipacket routing and sorting on meshes ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Mesh permutation routing with locality ⋮ Packet Routing on grids of processors ⋮ Optimal permutation routing for low-dimensional hypercubes ⋮ Algorithms for the parallel alternating direction access machine ⋮ Analysis of permutation routing algorithms
Cites Work
This page was built for publication: A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues