Deadlock-free message routing in multicomputer networks

DOI10.1007/BF01784886zbMath0679.68006OpenAlexW2042208180MaRDI QIDQ1822919

Peter A. J. Hilbers, Johan J. Lukkien

Publication date: 1989

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01784886

zbMATH Keywords

Cut-through routingdeadlock freeness-Cartesian productprocessor network-Routing algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Cites Work

• Local Distributed Deadlock Detection by Cycle Detection and Clusterng
• Virtual cut-through: A new computer communication switching technique

This page was built for publication: Deadlock-free message routing in multicomputer networks