scispace - formally typeset
Open Access

Routing messages through networks: an exercise in deadlock avoidance

Bill Roscoe
About
The article was published on 1987-01-01 and is currently open access. It has received 54 citations till now. The article focuses on the topics: Deadlock & Routing (electronic design automation).

read more

Citations
More filters
Book

The Theory and Practice of Concurrency

A. W. Roscoe
TL;DR: This book provides a detailed foundation for working with CSP, using as little mathematics as possible, and introduces the ideas behind operational, denotational and algebraic models of CSP.
Book

Interconnection Networks

TL;DR: The authors present in a structured way the basic underlying concepts of most interconnection networks and provide representative solutions that have been implemented in the industry or proposed in the research literature.
Journal ArticleDOI

A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks

TL;DR: The theoretical background for the design of deadlock-free adaptive routing algorithms for virtual cut-through and store-and-forward switching is developed and a design methodology is proposed, which automatically supplies fully adaptive, minimal and non-minimal routing algorithms.
Proceedings ArticleDOI

High Performance Communications In Processor Networks

TL;DR: This paper proposes a solution to deadlock free, adaptive, high throughput packet routing to be implemented on networks of processors, which serves as a basis for a very low latency routing strategy named the mad postman.
Journal ArticleDOI

Adaptive, low latency, deadlock-free packet routing for networks of processors

TL;DR: In this article, the authors propose a solution for deadlock free, adaptive, high throughput packet routing to be implemented on networks of processors, which can satisfy a number of requirements, namely deadlock and livelock freedom, good hot-spot performance, high-throughput and low latency.
Related Papers (5)