A formally verified deadlock-free routing function in a fault-tolerant NoC architecture

  • Alhussien A
  • Bagherzadeh N
  • Verbeek F
 et al. 
  • 2


    Mendeley users who have this article in their library.
  • 2


    Citations of this article.


A novel fault-tolerant adaptive wormhole routing function for Networks-on-Chips (NoCs) is presented. The routing function guarantees absence of deadlocks and livelocks up to two faulty channels. The routing logic does not require reconfiguration when a fault occurs. The routes themselves are dynamic. Based on the faults in the network, alternative routes are used to reroute packets. Routing decisions are based only on local knowledge, which allows for fast switching. Our approach does not use any costly virtual channels. As we do not prohibit cyclic dependencies, the routing function provides minimal routing from source to destination even in the presence of faults. We have implemented the architecture design using synthesizable HDL. To ensure deadlock freedom, we have extended a formally verified deadlock detection algorithm to deal with fault tolerant designs. For a 20x20 mesh, we have formally proven deadlock freedom of our design in all of the 2,878,800 configurations in which two channels are faulty. We supply experimental results showing the performance of our architecture. ©2012 IEEE.

Author-supplied keywords

  • Adaptive wormhole routing; Alternative routes; Arc
  • Design; Integrated circuits; Systems analysis
  • Network architecture

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • PUI: 366229829
  • ISBN: 9781467326087
  • SGR: 84870830340
  • SCOPUS: 2-s2.0-84870830340


  • A.a Alhussien

  • N.a Bagherzadeh

  • F.b Verbeek

  • B.b Van Gastel

  • J.c Schmaltz

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free