Embedded Transitive Closure Network for Runtime Deadlock Detection in Networks-on-Chip

Citations Over TimeTop 10% of 2011 papers

Abstract

Interconnection networks with adaptive routing are susceptible to deadlock, which could lead to performance degradation or system failure. Detecting deadlocks at runtime is challenging because of their highly distributed characteristics. In this paper, we present a deadlock detection method that utilizes runtime transitive closure (TC) computation to discover the existence of deadlock-equivalence sets, which imply loops of requests in networks-on-chip (NoCs). This detection scheme guarantees the discovery of all true deadlocks without false alarms in contrast with state-of-the-art approximation and heuristic approaches. A distributed TC-network architecture, which couples with the NoC infrastructure, is also presented to realize the detection mechanism efficiently. Detailed hardware realization architectures and schematics are also discussed. Our results based on a cycle-accurate simulator demonstrate the effectiveness of the proposed method. It drastically outperforms timing-based deadlock detection mechanisms by eliminating false detections and, thus, reducing energy wastage in retransmission for various traffic scenarios including real-world application. We found that timing-based methods may produce two orders of magnitude more deadlock alarms than the TC-network method. Moreover, the implementations presented in this paper demonstrate that the hardware overhead of TC-networks is insignificant.

Related Papers

• → Deadlock Detection Views of Distributed Database(2009)15 cited
• → A new deadlock detection algorithms for distributed real-time database systems(2002)7 cited
• Dynamic probe based strategy for deadlock prevention in distributed systems(2009)
• → Deadlock prevention and avoidance methods using timestamps for locking control in distributed database systems(1991)