Wait-for graph

Known as: Wait For Graph 
A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. In… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2015
012319912015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present Armus, a dynamic verification tool for deadlock detection and avoidance specialised in barrier synchronisation… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2011
2011
We propose a new distributed algorithm for detecting generalized deadlocks in distributed systems. It records the consistent… (More)
  • figure 2
  • table 1
  • table 2
  • figure 3
  • figure 5
Is this relevant?
2010
2010
In this paper, we propose a new algorithm to detect and resolve distributed deadlocks in the generalized model. The initiator of… (More)
Is this relevant?
2007
2007
A novel approach to detection of communication deadlocks in occam 2 programs is proposed. The main feature of the approach is to… (More)
  • figure 1
Is this relevant?
2005
2005
Numerous deadlock detection algorithms were proposed for distributed systems, but most of them assumed the static wait-for graph… (More)
  • figure 1
  • table 1
Is this relevant?
2004
2004
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and… (More)
  • table I
Is this relevant?
1996
1996
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and… (More)
Is this relevant?
1996
1996
Tasking deadlock is one of the most serious and complex problems concerning the reliability of concurrent systems with Ada. In… (More)
  • figure 1
Is this relevant?
1995
1995
Deadlock detection and resolution is one of the major component of a successful distributed database management system. In this… (More)
Is this relevant?
1991
1991
Tasking deadlocks a re one of the most serious a n d coniplex problenis in concurrent systems with Ada. Until now no methods a n… (More)
  • figure 1
Is this relevant?