Deadlock prevention for routing messages has a central role in communication networks,
since it directly influences the correctness of parallel and distributed systems. In this paper,
we extend some of the computational results presented in Second Colloquium on Structural
Information and Communication Complexity (SIROCCO), Carleton University Press, 1995,
pp. 1–12 on acyclic orientations for the determination of optimal deadlock-free routing
schemes. In this context, minimizing the number of buffers needed to prevent deadlocks for a …

Deadlock prevention for routing messages has a central role in communication networks,
since it directly influences the correctness of parallel and distributed systems. In this paper
we extend some of the computational results presented in [10] on acyclic orientations for the
determination of optimal deadlock free routing schemes. In this context, minimizing the
number of buffers needed to prevent deadlocks for a set of communication requests is
related to finding an acyclic orientation of the network which minimizes the maximum …