Formal Analysis of a Fault-Tolerant Routing Algorithm for a Network-on-Chip - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Formal Analysis of a Fault-Tolerant Routing Algorithm for a Network-on-Chip

Abstract

A fault-tolerant routing algorithm in Network-on-Chip 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 performs formal analysis on an extension of the link-fault tolerant Network-on-Chip architecture introduced by Wu et al. that supports multiflit wormhole routing. This paper describes several lessons learned during the process of constructing a formal model of this routing architecture. Finally, this paper presents how the deadlock freedom and tolerance to a single-link fault is verified for a two-by-two mesh version of this routing architecture.
Fichier principal
Vignette du fichier
fmics2014.pdf (218.84 Ko) Télécharger le fichier
fmics2014_slides.pdf (256.26 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Format Other

Dates and versions

hal-01064829 , version 1 (17-09-2014)

Identifiers

Cite

Zhen Zhang, Wendelin Serwe, Jian Wu, Tomohiro Yoneda, Hao Zheng, et al.. Formal Analysis of a Fault-Tolerant Routing Algorithm for a Network-on-Chip. 19th International Conference on Formal Methods for Industrial Critical Systems, FMICS 2014, Sep 2014, Florence, Italy. pp.48-62, ⟨10.1007/978-3-319-10702-8_4⟩. ⟨hal-01064829⟩
432 View
355 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More