A tool for automatic detection of deadlock in wormhole networks on chip | Zendy

Sami Taktak | Zendy; Jean-Lou Desbarbieux | Zendy; Emmanuelle Encrenaz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A tool for automatic detection of deadlock in wormhole networks on chip

Author(s) -

Sami Taktak,

Jean-Lou Desbarbieux,

Emmanuelle Encrenaz

Publication year - 2008

Publication title -

acm transactions on design automation of electronic systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.266

H-Index - 51

eISSN - 1557-7309

pISSN - 1084-4309

DOI - 10.1145/1297666.1297672

Subject(s) - computer science , deadlock , routing (electronic design automation) , deadlock prevention algorithms , distributed computing , extension (predicate logic) , function (biology) , adaptive routing , network on a chip , wormhole , routing algorithm , static routing , routing protocol , computer network , programming language , physics , quantum mechanics , evolutionary biology , biology

International audienceWe 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research