Filters








551 Hits in 3.0 sec

Deadlock Freedom for Asynchronous and Cyclic Process Networks

Bas van den Heuvel, Jorge A. Pérez
2021 Electronic Proceedings in Theoretical Computer Science  
We present APCP, a typed process framework for deadlock freedom which supports asynchronous communication, delegation, recursion, and a general form of process composition that enables specifying cyclic  ...  In particular, we consider the case of processes that implement session types by communicating asynchronously in cyclic process networks.  ...  Acknowledgements We are grateful to the anonymous reviewers for their careful reading of our paper and their useful feedback. We also thank Ornela Dardha for clarifying the typing rules of PCP to us.  ... 
doi:10.4204/eptcs.347.3 fatcat:2jt4raee5nbqpnn7r45vmvnob4

Deadlock Freedom for Asynchronous and Cyclic Process Networks (Extended Version) [article]

Bas van den Heuvel, Jorge A. Pérez
2021
We present APCP, a typed process framework for deadlock freedom which supports asynchronous communication, delegation, recursion, and a general form of process composition that enables specifying cyclic  ...  In particular, we consider the case of processes that implement session types by communicating asynchronously in cyclic process networks.  ...  Acknowledgements We are grateful to the anonymous reviewers for their careful reading of our paper and their useful feedback. We also thank Ornela Dardha for clarifying the typing rules of PCP to us.  ... 
doi:10.48550/arxiv.2111.13091 fatcat:srxmiukqjbd75ezygmxqrarc4e

A novel algorithm for discrete-event simulation: asynchronous distributed discrete-event simulation algorithm for cyclic circuits using a dataflow network

E. DeBenedictis, S. Ghosh, M.-L. Yu
1991 Computer  
No reponed parallel-processor algorithm for circuits in which the process inter.tctions form a cyclic graph offers a solution with acceptable performance, freedom from deadlock. and provable correctness  ...  Conds. respec· June 1991 A synthesized dataflow network and a computed quantity "time of next event" guarantee correctness and freedom from deadlock. th·tly.  ... 
doi:10.1109/2.86834 fatcat:5q7davrcjzglrd4frilpnxkq7m

A type-theoretic approach to deadlock-freedom of asynchronous systems [chapter]

Samson Abramsky, Simon Gay, Rajagopal Nagarajan
1997 Lecture Notes in Computer Science  
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems.  ...  In the resulting category ASProcD, combining well-typed processes preserves deadlock-freedom. It is also possible to accommodate non-compositional methods within the same framework.  ...  Acknowledgements We w ould like to thank the referees for their valuable comments.  ... 
doi:10.1007/bfb0014557 fatcat:2bqd3qgl4zeohoe2upcn7egkiy

Page 4383 of Mathematical Reviews Vol. , Issue 2002F [page]

2002 Mathematical Reviews  
One benefit of characterizing when unreachable cyclic con- figurations can occur is that proving deadlock freedom is simplified for networks in which unreachable cycles cannot exist.  ...  Summary: “A great deal of work has been done recently on de- veloping techniques for proving deadlock freedom for wormhole routing algorithms.  ... 

What is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1997 Electronical Notes in Theoretical Computer Science  
and divergence-freedom.  ...  The -calculus with synchronous output and mixed-guarded choices is strictly more expressive than the -calculus with asynchronous output and no choice.  ...  Acknowledgement The author would like to thank C edric Fournet, Kohei Honda, Naoki Kobayashi, Catuscia Palamidessi, Benjamin Pierce, Davide Sangiorgi, Martin Ste en, and Nobuko Yoshida for many fruitful  ... 
doi:10.1016/s1571-0661(05)80474-8 fatcat:toc36ecepnh2znenleb73aj2te

A provably correct, non-deadlocking parallel event simulation algorithm

Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
1991 ACM SIGSIM Simulation Digest  
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation.  ...  The data-flow network also uses the asynchronous parallel discrete event driven technique and runs concurrently with the network of simulation models.  ...  Freedom from Deadlock To prove YADDES is deadlock-free, we first restate that W-computation in the data-flow network can never deadlock as the network is acyclic.  ... 
doi:10.1145/106073.106104 fatcat:rge2v3pvsjaptegkf2nxy46vme

Formal Verification of CHP Specifications with CADP Illustration on an Asynchronous Network-on-Chip

Gwen Salaun, Wendelin Serwe, Yvain Thonnart, Pascal Vivet
2007 Advanced Research in Asynchronous Circuits and Systems (ASYNC) Proceedings of the International Symposium on  
In this paper, we illustrate our technique on an asynchronous Network-on-Chip architecture.  ...  The CADP toolbox capabilities allow the designer to verify properties such as deadlock-freedom or protocol correctness on substantial systems.  ...  The authors would like to thank their colleagues from the TIMA CIS group for providing the TAST CHP syntax, and for valuable discussions on the probe semantics.  ... 
doi:10.1109/async.2007.18 dblp:conf/async/SalaunSTV07 fatcat:qcvjfcn23bddzjpld6ldkibtc4

What is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1999 BRICS Report Series  
to compositionality and divergence-freedom.  ...  The pi-calculus with synchronous output and mixed-guarded choices is strictly more expressive than the pi-calculus with asynchronous output and no choice.  ...  discussions, and the anonymous referees for their constructive remarks.  ... 
doi:10.7146/brics.v6i43.20113 fatcat:zdh72ucvkbabllrkhmvrd7lrzu

Deterministic Message Passing for Distributed Parallel Computing

Xu ZHOU, Kai LU, Xiaoping WANG, Wenzhe ZHANG, Kai ZHANG, Xu LI, Gen LI
2013 IEICE transactions on information and systems  
To avoid deadlocks introduced by deterministic mechanisms, we also integrate DMPI with a lightweight deadlock checker to dynamically detect and solve these deadlocks.  ...  The basic idea of DMPI is to use logical time to solve message races and control asynchronous transmissions, and thus we could eliminate the nondeterministic behaviors of the existing message-passing mechanism  ...  In turn, Process 1 blocks Process 3 as it cannot increase its logical time. As a result, the cyclic dependence causes a deadlock. We solve the deadlock problem in two levels.  ... 
doi:10.1587/transinf.e96.d.1068 fatcat:mtobbwc3cnh6xa5bzogzw4kkuq

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  
The routing algorithm is proven to have several desirable properties including deadlock and livelock freedom, and tolerance to a single-link-fault.  ...  A fault-tolerant routing algorithm in Network-on-Chip (NoC) architectures provides adaptivity for on-chip communications.  ...  Deadlock freedom and single-link-fault tolerance are proved in a congested network with zero or one link fault.  ... 
doi:10.1016/j.scico.2016.01.002 fatcat:t43j6pvb2vd4hpa32iz4qbqhby

What is a "Good" Encoding of Guarded Choice?

Uwe Nestmann
2000 Information and Computation  
For this case, we show how to prove important``reasonable'' properties like deadlock-and divergence-freedom.  ...  Mixed Choice In analogy to the discussion on cyclic waiting (Section 4), the type-checker (strategy A) for deadlock-freedom fails, when reusing the encoding for separate choice in the case of mixed choice  ... 
doi:10.1006/inco.1999.2822 fatcat:hldwafyoarbcxd3abh5otm2iui

What Is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1997 BRICS Report Series  
to compositionality and divergence-freedom.  ...  The pi-calculus with synchronous output and mixed-guarded choices is strictly more expressive than the pi-calculus with asynchronous output and no choice.  ...  B.3 Mixed choice In analogy to the discussion on cyclic waiting ( §4), the type-checker (strategy A) for deadlock-freedom fails, when reusing the encoding for separate choice in the case of mixed choice  ... 
doi:10.7146/brics.v4i45.19266 fatcat:ft4tknmnenfczpy6wvorru2r7e

Fault Adaptive Routing in Metasurface Controller Networks [article]

Taqwa Saeed, Constantinos Skitsas, Dimitrios Kouzapas, Marios Lestas, Vassos Soteriou, Anna Philippou, Sergi Abadal, Christos Liaskos, Loukas Petrou, Julius Georgiou, Andreas Pitsillides
2018 arXiv   pre-print
The Manhattan-like topology chosen to realize the controller network in the testbed under development is irregular, with restricted local path selection options, operating in an asynchronous fashion.  ...  In this paper, we present work in progress towards the development of fault-tolerant routing mechanisms for the chosen architecture.  ...  Essentially, as long as FT routing provides full connectivity devoid of cyclic channel dependencies in a sub-connected (i.e., faulty) topology, then the FT function crucially guarantees deadlock-and livelock-freedom  ... 
arXiv:1810.06329v1 fatcat:n6oy25oqhrgxte2elyynsbheri

Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing

Jie Wu, Li Sheng
2005 Journal of Supercomputing  
A deadlock-free multicast scheme called prefix multicasting in irregular networks (i.e., networks with irregular topology) is studied.  ...  It is shown that the proposed routing scheme is deadlock-and livelock-free.  ...  Deadlock-freedom is ensured by restricting the way a channel is used.  ... 
doi:10.1023/b:supe.0000049325.58858.72 fatcat:vs3tgbuy2bbzjlwuqhvp3pn2em
« Previous Showing results 1 — 15 out of 551 results