Filters








28,282 Hits in 4.0 sec

Some deadlock properties of computer systems

Richard C. Holt
1972 ACM SIGOPS Operating Systems Review  
Several examples of deadlock occurring in present day computer systems are given Next, there is a discussion of the strategms which can be ~sed to deal with the deadlock problem A theory of computer systems  ...  Then a rumple graph model of computer systems m developed, and its deadlock propertms are investigated This graph model unifies a number of previous results, leads to efficient deadlock detection and prevenUon  ...  COMPUTER SYSTEMS AND DEADLOCK In this paper we present a simple graph model of computer systems and investigate its deadlock properties.  ... 
doi:10.1145/850614.850627 fatcat:qyv2qq3xyvgwrh2txkoekq7oiq

Some Deadlock Properties of Computer Systems

Richard C. Holt
1972 ACM Computing Surveys  
Several examples of deadlock occurring in present day computer systems are given Next, there is a discussion of the strategms which can be ~sed to deal with the deadlock problem A theory of computer systems  ...  Then a rumple graph model of computer systems m developed, and its deadlock propertms are investigated This graph model unifies a number of previous results, leads to efficient deadlock detection and prevenUon  ...  COMPUTER SYSTEMS AND DEADLOCK In this paper we present a simple graph model of computer systems and investigate its deadlock properties.  ... 
doi:10.1145/356603.356607 fatcat:qpuwxvbdlrhpxdrr3a7rrvdw4u

Some deadlock properties of computer systems

Richard C. Holt
1971 Proceedings of the third symposium on Operating systems principles - SOSP '71  
Several examples of deadlock occurring in present day computer systems are given Next, there is a discussion of the strategms which can be ~sed to deal with the deadlock problem A theory of computer systems  ...  Then a rumple graph model of computer systems m developed, and its deadlock propertms are investigated This graph model unifies a number of previous results, leads to efficient deadlock detection and prevenUon  ...  COMPUTER SYSTEMS AND DEADLOCK In this paper we present a simple graph model of computer systems and investigate its deadlock properties.  ... 
doi:10.1145/800212.806501 dblp:conf/sosp/Holt71 fatcat:hq24i67yuvfwpakjorfsq3isea

Automatic verification of properties in transition systems

A. Arnold, S. Brlek
1995 Software, Practice & Experience  
The aim of this paper is to show the use of MEC, an automated tool for analysing transition systems, for discovering deadlocks, livelocks and other properties of a given transition system.  ...  The features of MEC are shown with two instructive examples: first, the analysis of an electronic mail system, first analysed by G.  ...  Thanks also to David Sherman for his careful reading of the paper.  ... 
doi:10.1002/spe.4380250602 fatcat:jbfwhvyturcyfjx55wgczrzaaq

Design of Petri net-based deadlock prevention controllers for flexible manufacturing systems

Guoqian Zeng, Weimin Wu, MengChu Zhou, Weijie Mao, Hongye Su, Jian Chu
2009 2009 IEEE International Conference on Systems, Man and Cybernetics  
It starts from the computation of the complete deadlock markings by utilizing the conservativeness property of a Petri net model and the necessary and sufficient condition for deadlock.  ...  Its obtained deadlock-free controller allows more behavior of the closed-loop system than those obtained via a siphon-based control method.  ...  some state M k , we expect to know where the system will go after some transition (event) fires.  ... 
doi:10.1109/icsmc.2009.5346582 dblp:conf/smc/WuZZMSC09 fatcat:zqrg3v7r4bckhho2dw2mctjycy

On distributed snapshots

Ten H. Lai, Tao H. Yang
1987 Information Processing Letters  
We also show that several stable properties (e.g., termination, deadlock) can be detected with uncoordinated distributed snapshots. For such properties, our algorithm can be further simplified.  ...  Besides local-deadlock, "the entire system is deadlocked" and "the system is terminated" [6] are also strongly stable properties.  ...  A property y of system D = (P, C) is strongly stable iff y(GS('q)) implies y(GSN) and y(GSN) implies y(GS('r2) ) for all global snapshots GSN taken between times ,q and "r 2 during all computations of  ... 
doi:10.1016/0020-0190(87)90125-6 fatcat:r6le4tpldrerhnvczt3ndvghr4

D-Finder: A Tool for Compositional Deadlock Detection and Verification [chapter]

Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, Joseph Sifakis
2009 Lecture Notes in Computer Science  
For deadlock detection, D-Finder applies proof strategies to eliminate potential deadlocks by computing increasingly stronger invariants.  ...  D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction.  ...  properties Φ 1 , Φ 2 respectively, and C(Φ 1 , Φ 2 , Φ) is some condition taking into account the semantics of parallel composition operation and relating the individual properties with the global property  ... 
doi:10.1007/978-3-642-02658-4_45 fatcat:5y5jc3nr35cqjnh4muwa2hld5i

Page 6694 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
Some properties of the two operation types are investigated.  ...  “In order to apply the operator ‘changes to’ for proving a property of an example system, we introduce some additional operators and a part of the proof calculus.”  ... 

A minimal property for characterizing deadlock-free programs

Vicent Cholvi, Pablo Boronat
2001 Information Processing Letters  
Roughly speaking, it consists of providing some mechanism to avoid race conditions in the access of shared resources by two or more concurrent processes.  ...  In this paper, we identify a program property, namely, being stopper-free, which can be used to know if programs are deadlock-free.  ...  Detecting when the state of a distributed computation satisfies a certain property, namely, if deadlocks may occur, constitutes a fundamental issue in the design of concurrent programs.  ... 
doi:10.1016/s0020-0190(00)00158-7 fatcat:njedhfo2azax7m7wxspl7o6xh4

Page 1966 of Mathematical Reviews Vol. , Issue 80E [page]

1980 Mathematical Reviews  
The problem of deadlock in computer systems and a model applicable to the investigation of this problem are presented.  ...  Results of calcula- tions on actual computer system models are also described, indi- cating that within the types of systems considered, the probability of deadlock increases.” 80e:68054 Fischer, Patrick  ... 

Page 209 of Distributed Computing Vol. 4, Issue 4 [page]

1991 Distributed Computing  
In par¬ ticular, we formulate some simple theorems which char¬ acterize the states in which deadlock can occur, and use them to prove some theorems on the absence of global deadlock in systems.  ...  The simple mathemati¬ cal structure of this model lends itself to clean formula¬ tion of deadlock properties and to formal manipulation of process behaviour.  ... 

A Review of Distributed Deadlock Detection Techniques based on Diffusion Computation Approach

Sonia Singh, S. S. Tyagi
2012 International Journal of Computer Applications  
This paper provides a comprehensive review of the some of the existing techniques for deadlock detection in distributed environment.  ...  Because distributed systems are more vulnerable to deadlocks, the problems of deadlock detection and resolution have long been considered important problems in such systems.  ...  Global State Detection Based Algorithms A consistent snapshot of a distributed system can be obtained without freezing the underlying computation and If a stable property holds in the system before the  ... 
doi:10.5120/7377-0186 fatcat:2wksulfbhrfb7aftwtpncqp5dm

Deadlock-free buffer configuration for stream computing

Peng Li, Jonathan C Beard, Jeremy D Buhler
2016 The international journal of high performance computing applications  
However, the connection between the configuration of output buffers and application deadlocks has not been studied.  ...  In this paper, we show that bad configuration of output buffers can lead to application deadlock. We prove necessary and sufficient condition for deadlock-free buffer configurations.  ...  (Deadlock) A system is said to deadlock if no node in the system can make progress, but some channel in the system still retains unprocessed data items (so that the computation is incomplete).  ... 
doi:10.1177/1094342016675679 fatcat:w2ht4rzksvft7gmv3sym4vzjse

Robust supervisory control policies for manufacturing systems with unreliable resources

M.A. Lawley, W. Sulistyono
2002 IEEE Transactions on Robotics and Automation  
One active area of research has been developing deadlock avoidance methods for these systems. Almost all work to date has assumed that allocated resources do not fail.  ...  In this paper, we consider deadlock and blocking problems in systems with unreliable resources.  ...  At that point, a route reassignment is computed and some set of parts is removed from the system in order to continue operation.  ... 
doi:10.1109/tra.2002.1019464 fatcat:4vhcqwsl5zg65g567a7fvydxcm

Deadlock-free buffer configuration for stream computing

Peng Li, Jonathan Beard, Jeremy Buhler
2015 Proceedings of the Sixth International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM '15  
However, the connection between the configuration of output buffers and application deadlocks has not been studied.  ...  In this paper, we show that bad configuration of output buffers can lead to application deadlock. We prove necessary and sufficient condition for deadlock-free buffer configurations.  ...  (Deadlock) A system is said to deadlock if no node in the system can make progress, but some channel in the system still retains unprocessed data items (so that the computation is incomplete).  ... 
doi:10.1145/2712386.2712403 dblp:conf/ppopp/LiBB15 fatcat:tghn2rid65hrlndm3ba7fei5zy
« Previous Showing results 1 — 15 out of 28,282 results