HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

An improved fault-tolerant routing algorithm for a Network-on-Chip derived with formal analysis

Abstract : A fault-tolerant routing algorithm in Network-on-Chip (NoC) architectures provides adaptivity for on-chip communications. Adding fault-tolerance adaptivity to a routing algorithm increases its design complexity and makes it prone to deadlock and other problems if improperly implemented. Formal verification techniques are needed to check the correctness of the design. This paper describes the discovery of a potential livelock problem through formal analysis on an extension of the link-fault tolerant NoC architecture introduced by Wu et al. In the process of eliminating this problem, an improved routing architecture is derived. The improvement simplifies the routing architecture, enabling successful verification using the CADP verification toolbox. The routing algorithm is proven to have several desirable properties including deadlock and livelock freedom, and tolerance to a single-link-fault.
Complete list of metadata

Cited literature [41 references]  Display  Hide  Download

Contributor : Wendelin Serwe Connect in order to contact the contributor
Submitted on : Monday, January 25, 2016 - 7:29:07 AM
Last modification on : Friday, February 4, 2022 - 3:24:02 AM
Long-term archiving on: : Tuesday, April 26, 2016 - 10:22:36 AM


Files produced by the author(s)



Zhen Zhang, Wendelin Serwe, Jian Wu, Tomohiro Yoneda, Hao Zheng, et al.. An improved fault-tolerant routing algorithm for a Network-on-Chip derived with formal analysis. Science of Computer Programming, Elsevier, 2016, ⟨10.1016/j.scico.2016.01.002⟩. ⟨hal-01261234⟩



Record views


Files downloads