A tool for automatic detection of deadlock in wormhole networks on chip
Sami Taktak, Jean-Lou Desbarbieux, Emmanuelle Encrenaz · ACM Transactions on Design Automation of Electronic Systems · 2008
We present an extension of Duato's necessary and sufficient condition a routing function must satisfy in order to be deadlock-free, to support environment constraints inducing extra-dependencies between messages. We also present an original algorithm to automatically check the deadlock-freeness of a network with a given routing function. A prototype tool has been developed and automatic deadlock checking of large scale networks with various routing functions have been successfully achieved. We provide comparative results with standard approach, highlighting the benefits of our method.