A polynomial algorithm to prove deadlock-freeness of wormhole networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

A polynomial algorithm to prove deadlock-freeness of wormhole networks

Abstract

Deadlocks are an important issue in wormhole networks and a lot of works have been done on deadlock avoidance. Sufficient and necessary deadlock-freeness conditions have been proposed and used to build deadlock-free wormhole networks. But none of these works provide an efficient way to verify if a given network is deadlock-free. The present article proposes a new sufficient and necessary condition associated with a polynomial algorithm to check if a given network is deadlock-free. This new algorithm identifies escape paths from channels that are involved in circular dependencies. Identifying escape paths can be easily done by studying strongly connected components of the dependency graph instead of studying individually each cycle. The proposed algorithm has been implemented in a tool for automatic detection of deadlocks in wormhole networks (ODI). ODI has been used to establish the deadlock-freeness of complex realistic networks and networks with defective routers.
No file

Dates and versions

hal-01290701 , version 1 (18-03-2016)

Identifiers

Cite

Sami Taktak, Emmanuelle Encrenaz, Jean-Lou Desbarbieux. A polynomial algorithm to prove deadlock-freeness of wormhole networks. PDP EUROMICRO Conference on Parallel, Distributed and Network-based Computing IEEE Computer Society, Feb 2010, Pisa, Italy. pp.121-128, ⟨10.1109/PDP.2010.19⟩. ⟨hal-01290701⟩
187 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More