1
Network Rou+ng Resource dependency graph Markings Resource r is: Deadlock‐sensi+ve Deadlock‐immune Deadlock‐a=ainable Formally verified deadlock detec+on in packet and wormhole networks NWO free compe,,on 612.064.811 Deadlock‐free rou+ng Results Topologies: Mesh/ring Virtual channels References Formal verifica+on Switching policy Packet Wormhole Rou+ng func+ons: Determinis+c/adap+ve Cyclic/acyclic dependencies Freek Verbeek, Radboud Universiteit Nijmegen, [email protected] Julien Schmaltz, Open Universiteit Nederland, [email protected] Formally verified: Necessary and sufficient condi+ons Correctness of specifica+on of algorithms F. Verbeek and J. Schmaltz. A Fast and Verified Algorithm for Proving Store‐and‐Forward Networks Deadlock‐Free (PDP'11) ‐‐‐‐. Automa+c verifica+on for deadlock in networks‐on‐chips with adap+ve rou+ng and wormhole switching (NOCS ‘11) ‐‐‐‐. On Necessary and Sufficient Condi3ons for Deadlock‐Free Rou3ng in Wormhole Networks (TPDS ’11) ‐‐‐‐. A Comment on “A Necessary and Sufficient Condi3on for Deadlock‐ Free Adap3ve Rou3ng in Wormhole Networks” (TPDS ‘11) Algorithms Deadlock freedom is an essen+al property for Networks‐on‐chips Manual deadlock detec+on is extremely error‐prone Switching Complexity Complete Formally verified Packet O(N 2 ) Yes Yes Wormhole O(N 3 ) No Yes Source code and proof scripts: h=p://www.cs.ru.nl/~freekver/dl_ic.html Implementa+on of algorithms in C d 0 d 1 A B C E D F B C E A D F Example:

Formally veriï¬ed deadlock detecon in packet and wormhole networks

  • Upload
    others

  • View
    2

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Formally veriï¬ed deadlock detecon in packet and wormhole networks

Network

Rou+ng

Resourcedependencygraph

Markings

Resourceris:

Deadlock‐sensi+ve

Deadlock‐immune

Deadlock‐a=ainable

Formallyverifieddeadlockdetec+oninpacketandwormholenetworksNWOfreecompe,,on612.064.811

Deadlock‐freerou+ng

Results

Topologies: Mesh/ring Virtualchannels

References

Formalverifica+on

Switchingpolicy Packet Wormhole

Rou+ngfunc+ons: Determinis+c/adap+ve Cyclic/acyclicdependencies

FreekVerbeek,RadboudUniversiteitNijmegen,[email protected],OpenUniversiteitNederland,[email protected]

Formallyverified: Necessaryandsufficientcondi+ons Correctnessofspecifica+onofalgorithms

 F.VerbeekandJ.Schmaltz.AFastandVerifiedAlgorithmforProvingStore‐and‐ForwardNetworksDeadlock‐Free(PDP'11) ‐‐‐‐.Automa+cverifica+onfordeadlockinnetworks‐on‐chipswithadap+verou+ngandwormholeswitching(NOCS‘11) ‐‐‐‐.OnNecessaryandSufficientCondi3onsforDeadlock‐FreeRou3nginWormholeNetworks(TPDS’11) ‐‐‐‐.ACommenton“ANecessaryandSufficientCondi3onforDeadlock‐FreeAdap3veRou3nginWormholeNetworks”(TPDS‘11)

Algorithms

 Deadlockfreedomisanessen+alpropertyforNetworks‐on‐chips Manualdeadlockdetec+onisextremelyerror‐prone

Switching Complexity Complete Formallyverified

Packet O(N2) Yes YesWormhole O(N3) No Yes

Sourcecodeandproofscripts:h=p://www.cs.ru.nl/~freekver/dl_ic.html

Implementa+onofalgorithmsinC

d0 d1

AB C

E DFB

CE

A

D

F

Example: