A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Self-stabilizing Deadlock Detection Under the OR Requirement Model
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
The algorithm is complete, because it detects all deadlocks, and it is correct, because it does not detect false deadlocks. ...
This article introduces a self-stabilizing deadlock-detection algorithm for the OR model. ...
In addition, transient-fault tolerance is a desirable property for a distributed deadlock-detection algorithm. ...
doi:10.1007/11823285_58
fatcat:rw2zshkxxfcnlnaghihsxe7owi
On-line detection and resolution of communication deadlocks
1994
Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This is achieved via a novel technique for detecting knots, which sufice for the existence of communication deadlocks. Current distributed deadlock detection algorithms lack these features. ...
W e present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are made, at no additional ...
by the detection of a deadlock. ...
doi:10.1109/hicss.1994.323231
fatcat:zafvd4awrvdzxfrwinoas4izcq
A Review of Distributed Deadlock Detection Techniques based on Diffusion Computation Approach
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
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. ...
The detection messages (probe, label, token and deadlock detection agent) were created by the nodes and propagated along the edges to find the closed cycle or knots. ...
doi:10.5120/7377-0186
fatcat:2wksulfbhrfb7aftwtpncqp5dm
Conservative distributed simulation of Petri nets
1994
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
approach, . to detect and resolve deadlocks. ...
A method is presented: . to use any local simulator of Petri nets based to handle local simulation, l to reduce the number of Null messages used to circumvent deadlocks which can occur in the conservative ...
Hence, it is possible to detect deadlock by simply checking if a number of idle processes forms a knot. ...
doi:10.1016/0898-1221(94)90122-8
fatcat:hvwd6yae7jeivi7j7pdwaxdnxq
MPI Runtime Error Detection with MUST: Advances in Deadlock Detection
2013
Scientific Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We present improvements to our graph-based deadlock detection approach for MPI, which cover future MPI extensions. ...
Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. ...
Although MUST covers various process-local correctness checks, this paper focuses on its non-local checks, primarily deadlock detection. ...
doi:10.1155/2013/314971
fatcat:wogkn6qqrjevbpe5httfensz7i
MPI runtime error detection with MUST: Advances in deadlock detection
2012
2012 International Conference for High Performance Computing, Networking, Storage and Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. ...
We present improvements to our graph-based deadlock detection approach for MPI, which cover complex MPI constructs, as well as future MPI extensions. ...
If translate returns an AND⊕OR WFG with an OR-knot, for each node x that was added by t and that an OR-knot includes, the following holds: If x was added by processing a wait-for condition of a process ...
doi:10.1109/sc.2012.79
dblp:conf/sc/HilbrichPSSM12
fatcat:gkeoflbcarcork7jdtlbdvk3ey
A distributed graph algorithm for the detection of local cycles and knots
1998
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
In this paper, a distributed cycle/knot detection algorithm for general graphs is presented. ...
node is in a cycle or a knot. ...
Kshemkalyani and Singhal [16] presented a distributed algorithm for detecting a generalized deadlock which corresponds to a deadlock in the AND/OR request model [13] . ...
doi:10.1109/71.706047
fatcat:lxoslfqle5atxave6rge7hfv64
Deadlock detection in distributed databases
1987
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The problem of deadlock detection in distributed systems has undergone extensive study. An important application relates to distributed database systems. ...
These principles represent mechanisms for developing distributed algorithms in general and deadlock detection schemes in particular. ...
The work was partially supported by Office of Naval Research contract N00014-86-K-0182. ...
doi:10.1145/45075.46163
fatcat:jhbyf4kxibbuxjrcb7eow23pgi
An Analysis and Improvement of Probe-Based Algorithm for Distributed Deadlock Detection
2015
Lecture Notes on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Deadlock detection and resolution is one among the major challenges faced by a Distributed System. ...
Different approaches have been adopted in distributed deadlock detection. ...
doi:10.7763/lnse.2015.v3.205
fatcat:vnh7qirjdvg2nnwgenewn5ti7e
Modelling deadlock in open restricted queueing networks
2018
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Highlights • A method of detecting deadlock in simulations of queueing networks. • Markov models of elementary open restricted queueing networks that deadlock built. • Expected time to deadlock investigated ...
This paper explores deadlock in queueing networks with limited queueing capacity, presents a method of detecting deadlock in discrete event simulations, and builds Markov chain models of these deadlocking ...
a local minimum for µ ∈ (0, ∞). ...
doi:10.1016/j.ejor.2017.10.039
fatcat:25jcg3rmmbenfljj4itwuaqv5q
An Efficient Detection and Resolution of Generalized Deadlocks in Distributed Systems
2010
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new algorithm to detect and resolve distributed deadlocks in the generalized model. ...
Since the termination detection of the proposed algorithm is isolated from deadlock detection, it minimizes the message length into a constant without using any explicit technique. ...
A deadlock is usually detected by examining the presence of either cycle or knot in the global WFG. ...
doi:10.5120/412-610
fatcat:2d2c2da3ebc7rc3t3mfb63y6zy
The Combinatorics of Resource Sharing
[chapter]
2002
Applied Optimization
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2003 pre-print arXiv:cs/0309044v1 fatcat:wdfuntzlfjertbfrqvef6uixbu
and deadlock-handling policies, and concurrency issues. ...
We discuss general models of resource-sharing computations, with emphasis on the combinatorial structures and concepts that underlie the various deadlock models that have been proposed, the design of algorithms ...
A (y − x)-knot appears in Wedeadlock detection, AND-OR modeldeadlock detection, disjunctive xout-of-y model now turn to a discussion of sufficient conditions for deadlocks to exist in W under the AND-OR ...
doi:10.1007/978-1-4757-3609-0_2
fatcat:h57rco7nhncvzcgjmlwkbsmk6e
Distributed deadlock detection
1983
ACM Transactions on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Distributed deadlock models are presented for resource and communication deadlocks. Simple distributed algorithms for detection of these deadlocks are given. ...
We show that all true deadlocks are detected and that no false deadlocks are reported. In our algorithms, no process maintains global information; all messages have an identical short length. ...
In particular, the proof of Theorem 2 was suggested by Scholten. We were helped greatly by comments from G. Andrews, N. Francez, C. A. R. Hoare, Anita Jones, and F. Schneider. ...
doi:10.1145/357360.357365
fatcat:ao5n4ysrbre7rcb4simthqkaku
A Distributed Graph Algorithm: Knot Detection
1982
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A knot in a directed graph is a useful concept in deadlock detection. A distributed algorithm for identifying a knot in a graph by using a network of processes is presented. ...
INTRODUCTION A vertex vi in a directed graph is in a knot if for every vertex vj reachable from vi, vi is reachable from vj. Chang [2] shows that knot is a useful concept in deadlock detection. ...
Dijkstra [3] has proposed a distributed algorithm for detecting whether a given process in a network of processes is in a knot. ...
doi:10.1145/69622.357190
fatcat:ndbvbgumhrhanor6o6tuiwlky4
A one-phase algorithm to detect distributed deadlocks in replicated databases
1999
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an efficient distributed algorithm to detect generalized deadlocks in replicated databases. ...
Due to the P-out-of-Q nature of quorum requests, deadlocks that arise are generalized deadlocks and are hard to detect. ...
ACKNOWLEDGMENTS A preliminary version of this algorithm appears in "Distributed Detection of Generalized Deadlocks,'' by Ajay D. ...
doi:10.1109/69.824601
fatcat:fqbyzwxnf5gh3na2xuwdzk53xy
« Previous
Showing results 1 — 15 out of 441 results