Optimal fully adaptive minimal wormhole routing for meshes

DOI10.1006/JPDC.1995.1071zbMath0833.68062OpenAlexW2030470272MaRDI QIDQ1898211

D. N. Jayasimha, Loren Schwiebert

Publication date: 24 September 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/388147d4ca292bdd8623beca344294f3006abbb9

zbMATH Keywords

routing algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (3)

Minimum-cost line broadcast in paths ⋮ Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks ⋮ How to improve snap-stabilizing point-to-point communication space complexity?

This page was built for publication: Optimal fully adaptive minimal wormhole routing for meshes