13,186 Hits in 2.9 sec

A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free

Freek Verbeek, Julien Schmaltz
2011 2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing  
In this paper we present the first algorithm that automatically proves routing functions deadlock-free for store-and-forward networks.  ...  A successful approach is to restrict the routing function such that it satisfies a necessary and sufficient condition for deadlock-free routing.  ...  Acknowledgments We would like to thank the anonymous reviewers for their apposite, constructive, and detailed comments.  ... 
doi:10.1109/pdp.2011.23 dblp:conf/pdp/VerbeekS11 fatcat:hbpfdtiaujb3njusq5gydwp754

A Decision Procedure for Deadlock-Free Routing in Wormhole Networks

Freek Verbeek, Julien Schmaltz
2014 IEEE Transactions on Parallel and Distributed Systems  
Our algorithm is the first to automatically check a necessary and sufficient condition for deadlock-free routing.  ...  Our tool needs four minutes to find a minimal deadlock in a 11 Â 11 torus while it needs nine hours for a 12 Â 12 network.  ...  ACKNOWLEDGMENT The authors would like to thank Z.  ... 
doi:10.1109/tpds.2013.121 fatcat:26mr47tlk5hstmhwv52uqrmuiy

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

Zhen Zhang, Wendelin Serwe, Jian Wu, Tomohiro Yoneda, Hao Zheng, Chris Myers
2014 Lecture Notes in Computer Science  
A fault-tolerant routing algorithm in Network-on-Chip architectures provides adaptivity for on-chip communications.  ...  Adding faulttolerance adaptivity to a routing algorithm increases its design complexity and makes it prone to deadlock and other problems if improperly implemented.  ...  To guarantee deadlock freedom, the routing algorithm disallows certain turns in the network.  ... 
doi:10.1007/978-3-319-10702-8_4 fatcat:naxfhztyqzb73feg5bwdr2frbe

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

Zhen Zhang, Wendelin Serwe, Jian Wu, Tomohiro Yoneda, Hao Zheng, Chris Myers
2016 Science of Computer Programming  
A fault-tolerant routing algorithm in Network-on-Chip (NoC) architectures provides adaptivity for on-chip communications.  ...  The routing algorithm is proven to have several desirable properties including deadlock and livelock freedom, and tolerance to a single-link-fault.  ...  To guarantee deadlock freedom, the routing algorithm disallows certain turns in the network.  ... 
doi:10.1016/j.scico.2016.01.002 fatcat:t43j6pvb2vd4hpa32iz4qbqhby

Survey of protocol definition and verification techniques

Carl A. Sunshine
1978 Computer Networks (1976)  
Techniques for definition and verification of computer network protocols have progressed significantly in the past two years to the point where complex real world protocols such as HDLC, X.25, and Cyclades  ...  This success is largely due to the combination of two apparently divergent approaches-state transitions, and assertion proofs-and to the greater automation of the verification process.  ...  Danthine [7] generates all paths (if any) leading to potential deadlock states.  ... 
doi:10.1016/0376-5075(78)90013-2 fatcat:ue2fd2tqcnbijo4qftfnhzelta

The FC2TOOLS set [chapter]

Amar Bouali, Annie Ressouche, Valérie Roy, Robert Simone
1996 Lecture Notes in Computer Science  
We are currently extending these features of FC2IMPLICIT SO that labeled predicates on states, hiding of behaviours irrelevant to specific analysis, and use of side observer automata would allow to check  ...  In addition FC2IMPLICIT has a fast checker for deadlocks, IiveIock or divergent states, for which it produces counterexample paths in case of existence, while FC2EXPLICIT allows compositional reduction  ...  We use symbolic methods based on BDDs for an easy evaluation of global state spaces and deadlock checking.  ... 
doi:10.1007/3-540-61474-5_98 fatcat:a2skyrt7jrd5hew3542iy53mee

Automatic generation of deadlock detection algorithms for a family of microarchitecture description languages of communication fabrics

Freek Verbeek, Julien Schmaltz
2012 2012 IEEE International High Level Design Validation and Test Workshop (HLDVT)  
Our main contribution is to automatically generate an efficient deadlock detection algorithm tailored to a given set of primitives.  ...  We prove that the automatically generated algorithms are correct by construction, i.e., they correctly detect deadlocks in all fabrics defined in the language for which they are generated.  ...  The algorithm searches for a state with a dead channel. It overapproximates the set of reachable states, i.e., it might find a deadlock state that is not reachable from an empty network.  ... 
doi:10.1109/hldvt.2012.6418239 dblp:conf/hldvt/VerbeekS12 fatcat:n26qsxn2tjetjp23d53bp6anqy

Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks

Sam Toueg, Kenneth Steiglitz
1981 SIAM journal on computing (Print)  
Deadlock states have been observed in existing packet switching networks [KL]; they tend to occur under near-saturation input load [GHKP].  ...  It is not hard to see that the network is deadlocked.  ...  It is easy to check that the network is in a deadlock state. Suppose now that the network has a deadlock state. Then there is at least one cycle of deadlocked packets in this state.  ... 
doi:10.1137/0210053 fatcat:pyimnevkbjggrjbkygagh2d5ze

Formal Verification of a Programmable Hypersurface [chapter]

Panagiotis Kouvaros, Dimitrios Kouzapas, Anna Philippou, Julius Georgiou, Loukas Petrou, Andreas Pitsillides
2018 Lecture Notes in Computer Science  
This paper shares the experience of a rigorous design procedure for the Hypersurface network, that involves iterations between designing a network and its protocols and the formal evaluation of each design  ...  The Hypersurface design is concerned with the development of a network of switch controllers that are responsible for configuring the metamaterial.  ...  Furthermore, also relating to the state-space explosion problem is the fact that we have to limit our analysis for specific configuration sequences, though in principle it would be useful to check algorithm  ... 
doi:10.1007/978-3-030-00244-2_6 fatcat:rpihi2fcsfawho5527eg7numj4

Distributed Deadlock Detection in Mobile Agent Systems [chapter]

Bruce Ashfield, Dwight Deugo, Franz Oppacher, Tony White
2002 Lecture Notes in Computer Science  
Existing solutions to distributed computing problems, such as deadlock avoidance algorithms, are not suited to environments where both clients and servers move freely through the network.  ...  This paper describes a distributed deadlock solution for use in mobile agent systems.  ...  For example, the distributed deadlock detection algorithm described by [5] states "The above algorithm should find any deadlock that occurs, provided that waiting transactions do no abort and there are  ... 
doi:10.1007/3-540-48035-8_15 fatcat:esuhazpbxjeafmouo4ypc2uem4

Consistency of Commitments in Social Web Services [article]

Marzieh Adelnia, Mohammad Reza Khayyambashi
2014 arXiv   pre-print
The aim of this study is presenting an algorithm for consistency ensuring between commitments. An application designed for proving correctness of algorithm.  ...  To guarantee accurate execution of web services operations, they must be accountable with regulations of the social networks in which they sign up.  ...  Also if deadlock occurred, coordinator recognized a safe state by using waiting graph and replace it instead deadlock state.  ... 
arXiv:1412.0152v1 fatcat:owbgiphzazachmcqymi2pfndkq

A Distributed Deadlock Detection and Resolution Algorithm for Process Networks

Gregory E. Allen, Paul E. Zucknick, Brian L. Evans
2007 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07  
We present the first algorithm that correctly performs dynamic deadlock detection and resolution for bounded scheduling of PN.  ...  The proposed algorithm is a modification of a distributed deadlock detection algorithm by Mitchell and Merritt.  ...  Fig. 2 . 2 State transitions for the D4R algorithm. and Merritt [10] to deadlock detection for PN.  ... 
doi:10.1109/icassp.2007.366165 dblp:conf/icassp/AllenZE07 fatcat:7qk2tdnjqba3bfdiptl3kivghe

A highly resilient routing algorithm for fault-tolerant NoCs

D. Fick, A. DeOrio, G. Chen, V. Bertacco, D. Sylvester, D. Blaauw
2009 2009 Design, Automation & Test in Europe Conference & Exhibition  
In this work, we present a network-onchip (NoC) routing algorithm to boost the robustness in interconnect networks, by reconfiguring them to avoid faulty components while maintaining connectivity and correct  ...  This distributed algorithm can be implemented in hardware with less than 300 gates per network router.  ...  For comparison, a 12x12 network requires an additional 30 gates, attributed to slightly larger state machine counters.  ... 
doi:10.1109/date.2009.5090627 dblp:conf/date/FickDCBSB09 fatcat:jdixkizfxzedxojohjhh6bospi

Ant Colony Optimization for Deadlock Detection in Concurrent Systems

Gianpiero Francesca, Antonella Santone, Gigliola Vaglini, Maria Luisa Villani
2011 2011 IEEE 35th Annual Computer Software and Applications Conference  
The biggest challenge toward the development of effective deadlock detection schemes remains the state-space explosion problem when model checking is used for proving the correctness of a system with respect  ...  In this paper we propose the use of the Ant Colony Optimization (ACO) to reduce the state explosion problem arising when finding deadlocks in complex networks described using Calculus of Communicating  ...  For this reason, they can be suitable for searching states (in particular deadlocks) in the graph of large system models, for which traditional exploration algorithms fail.  ... 
doi:10.1109/compsac.2011.22 dblp:conf/compsac/FrancescaSVV11 fatcat:7a7h2zxonrga7eqovfp3sdy4ay

A Tool for Automatic Detection of Deadlock in Wormhole Networks on Chip

Sami Taktak, Emmanuelle Encrenaz, Jean-lou Desbarbieux
2006 High Level Design Validation and Test Workshop (HLDVT), IEEE International  
We also present an original algorithm to automatically check the deadlockfreeness 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.  ...  The standard approach Here we present a alternative algorithm to check if a network is deadlock free. It is an adaptation of [Schwiebert and Jayasimha 1996] .  ... 
doi:10.1109/hldvt.2006.319992 dblp:conf/hldvt/TaktakED06 fatcat:jw6triag7fdqba2gwjxhgia35y
« Previous Showing results 1 — 15 out of 13,186 results