Fast deterministic hot-potato routing on processor arrays

DOI10.1007/3-540-58325-4_197MaRDI QIDQ4525720zbMATH OpenFDO

Authors Michael Kaufmann, Harald Lauer, Heiko Schröder

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_197

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• scientific article; zbMATH DE number 1256693
• A lower bound for nearly minimal adaptive and hot potato algorithms
• Greedy hot-potato routing on the two-dimensional mesh
• A lower bound for nearly minimal adaptive and hot potato algorithms

Cited in

(4)

• Many-to-many routing on trees via matchings
• Randomized Single-Target Hot-Potato Routing
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• Networks on which hot-potato routing does not livelock

This page was built for publication: Fast deterministic hot-potato routing on processor arrays

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