PVM: A Framework for Parallel Distributed Computing - Sunderam (1990)(Correct)(543 citations)
and consensus that enable the preemption of deadlock in several situations. Several projects similar
and is valuable in preventing certain forms of deadlock as well as in user-level detection of failed
and supports certain forms of error detection and recovery. 1. Introduction In recent years, www.hensa.ac.uk/parallel/environments/pvm3/emory-vss/pvmsystem.ps.Z
One or more of the query terms is very common - only partial results have been returned. Try Google (CiteSeer).
Virtual Time and Global States of Distributed Systems - Mattern (1989)(Correct)(351 citations)
and database systems like mutual exclusion, deadlockdetection, and concurrency control are much more
they become true) like termination detection and deadlockdetection, which shows that the snapshot
database systems like mutual exclusion, deadlockdetection, and concurrency control are much more www.isa.informatik.tu-darmstadt.de/VS/Publikationen/papers/VirtTime_GlobState.ps
The Concurrency Workbench: A Semantics Based Tool for.. - Cleaveland, Parrow.. (1994)(Correct)(210 citations)
more specialized kinds of analysis (such as deadlockdetection) and are used primarily to validate
computation and for nondeterminism (and hence deadlock) in the form of acceptance sets. These
specialized kinds of analysis (such as deadlockdetection) and are used primarily to validate (as opposed www.sics.se/~joachim/cwb.ps.Z
Eraser: A Dynamic Data Race Detector for.. - Savage, Burrows.. (1997)(Correct)(135 citations)
Systems]Process Management-concurrency deadlock multiprocessing/multiprogramming mutual
some did not compile and a few immediately deadlocked)Of these "working" assignments, 10% had data
modification, multithreaded programming, race detection 1. INTRODUCTION Multithreading has become a www.cs.washington.edu/homes/savage/papers/Tocs97.pdf
Better Verification Through Symmetry - Ip, Dill (1993)(Correct)(96 citations)
idea was further developed by Starke [Sta91] for deadlock and liveness checking in P/T nets. In
all of them do. Similarly, if one state is a deadlock (has no successors other than itself)so is
We address the two problems of this example: 1. detection of structural symmetries in the system. 2. sprout.stanford.edu/ip/sym.ps.gz
An Improvement of McMillan's Unfolding Algorithm - Esparza, Römer, Vogler (1996)(Correct)(89 citations)
He then shows how to use these prefixes for deadlockdetection. The unfolding technique has later
by inspection of the reachability graph (such as deadlock freedom, reachability of a marking etc.we can
then shows how to use these prefixes for deadlockdetection. The unfolding technique has later been applied flop.informatik.tu-muenchen.de/pub/theory/roemer/erv-unf-fmsd.ps.gz
Providing High Availability Using Lazy Replication - Ladin (1992)(Correct)(85 citations)
including distributed garbage collection [18]deadlockdetection [8]and orphan detection [23]
that could profit from this approach is deadlockdetection [8]4.2. Multiple Services We now
distributed garbage collection [18]deadlockdetection [8]and orphan detection [23]locating ftp.pmg.lcs.mit.edu/pub/harp/lazy-rep.ps.gz
Evaluating Deadlock Detection Methods for Concurrent Software - Corbett (1996)(Correct)(80 citations)
VOL. 22, NO. 3, MARCH 1996 1 Evaluating DeadlockDetection Methods for Concurrent Software James
for combating the state explosion problem in deadlockdetection: reachability search with a partial
VOL. 22, NO. 3, MARCH 1996 1 Evaluating DeadlockDetection Methods for Concurrent Software James C. www.ics.hawaii.edu/~corbett/tr/ics-tr-95-09.ps.Z
Overview of Multidatabase Transaction Management - Breitbart, Garcia-Molina.. (1992)(Correct)(79 citations)
(if one is used) to be used in global deadlockdetection. A local-wait-for-graph consists of a
transactions. A cycle in the graph indicates a deadlock situation.Get-serialization-order.
(if one is used) to be used in global deadlockdetection. A local-wait-for-graph consists of a set of www-db.stanford.edu/pub/papers/multidatabase.ps
A Performance Evaluation of Four Parallel Join Algorithms in .. - Schneider, DeWitt (1989)(Correct)(71 citations)
is reserved for query scheduling and global deadlockdetection. The remaining diskless processors
reserved for query scheduling and global deadlockdetection. We refer to this configuration as
reserved for query scheduling and global deadlockdetection. The remaining diskless processors execute ftp.cs.wisc.edu/pub/tech-reports/reports/89/tr836.ps.Z
Consistent Global States of Distributed Systems.. - Babaoglu, Marzullo (1993)(Correct)(60 citations)
the developed techniques by examining distributed deadlockdetection and distributed debugging as two
debugging, detection of particular states such as deadlock and termination, and dynamic adaptation of a
techniques by examining distributed deadlockdetection and distributed debugging as two instances of ftp.cs.ucsd.edu/pub/faculty/marzullo/global-states.ps.Z
Symbolic Verification of Communication Protocols with Infinite .. - Boigelot, al. (1997)(Correct)(50 citations)
most interesting verification problems, such as deadlockdetection, are undecidable for this class of
can be checked by exploring its state space: deadlocks, dead code, violations of user-specified
verification problems, such as deadlockdetection, are undecidable for this class of systems. www.bell-labs.com/user/god/public_psfiles/qdds.ps
Symbolic Verification of Communication Protocols with Infinite.. - al.(Correct)(50 citations)
most interesting verification problems, such as deadlockdetection, are undecidable for this class of
can be checked by exploring its state space: deadlocks, dead code, violations of user-specified
verification problems, such as deadlockdetection, are undecidable for this class of systems. www.montefiore.ulg.ac.be/~boigelot/research/BG96q.ps.gz
Efficient Algorithms for Distributed Snapshots and Global Virtual .. - Mattern (1993)(Correct)(46 citations)
termination of a distributed computation [18] or deadlock of a distributed system [7]More generally,
such as distributed termination or distributed deadlock. This can be achieved by repeatedly executing a
snapshot algorithms and distributed termination detection principles. 1 Introduction A snapshot of a www.isa.informatik.tu-darmstadt.de/VS/Publikationen/papers/snapshot_gvt.ps