The Deadlock problem: a classifying bibliography

@article{Zbel1983TheDP,
  title={The Deadlock problem: a classifying bibliography},
  author={Dieter Z{\"o}bel},
  journal={ACM SIGOPS Oper. Syst. Rev.},
  year={1983},
  volume={17},
  pages={6-15}
}
  • Dieter Zöbel
  • Published 1 October 1983
  • Computer Science
  • ACM SIGOPS Oper. Syst. Rev.
The desire for a better utilisation of resources and an acceleration of computing introduced the concept of parallelism with all its difficulties. Soon the danger of eternal delays of processes was discovered and called deadlock. For almost twenty years a lot of publications have dealt with problems considering deadlocks or their environment.Here we want to give a classification of our collected publications. We do not claim that this collection is complete in any sense, but we hope to have… 
Deadlock detection in distributed databases
TLDR
A uniform model in which published algorithms can be cast is given, and the fundamental principles on which distributed deadlock detection schemes are based are presented, and a hierarchy of deadlock models is presented.
A survey of distributed deadlock detection algorithms
TLDR
Only detection of resource deadlocks will be reviewed here, though other types of deadlock handling strategies and environments are briefly mentioned.
VGS Algorithm: An Efficient Deadlock Prevention Mechanism for Distributed Transactions using Pipeline Method
TLDR
Executing the transactions requesting for same resources in pipeline fashion has been discussed which efficiently prevents deadlocks and mechanism for reducing the waiting time of the requesting transactions has also been discussed.
Deadlock detection algorithms in distributed database systems
TLDR
An important extension to the basic CDDMOR, a partially distributed scheme, is proposed to alleviate the problem of congestion, as well as to take advantage of the result presented by several researchers that global (multisite) deadlocks are infrequent.
A partially distributed deadlock detection algorithm
TLDR
A partially distributed deadlock detection algorithm [PDDDA] with multiple outstanding requests is presented for use in distributed database systems and needs fewer messages and smaller storage space than a fully decentralized algorithm.
Survey of Deadlock Detection in Distributed Concurrent Programming Environments and Its Application to Real-time Systems and Ada Invited Paper
TLDR
This paper investigates deadlock detection algorithms in distributed environments and extends the results to real-time systems by considering timing constraints in the algorithms and develops a series of solutions depending on the level of restriction imposed on the use of Ada and relates those solutions to the levels of complexity associated with the theoretical models.
On-Line Control and Deadlock-Avoidance in a Page-Parallel Multiprocessor Rasterizer
  • Y. Birk
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1993
TLDR
It is shown that previously proposed approaches for deadlock avoidance cannot be applied directly due to a special form of nonexclusive allocation of shared resources, and a solution is given, thereby extending the applicability ofdeadlock avoidance.
A Total Need based Resource Reservation Technique for Effective Resource Management
TLDR
A Total Need Based Resource Reservation (TNRR) that suggests reserving some resources so as to ensure that at least one process will complete after it to reduce the time cost for making this decision.
AN EFFICIENT RESOURCE ALLOCATION TECHNIQUE FOR UNIPROCESSOR SYSTEM
TLDR
This paper shows that the overhead incurred by the existing Banker’s algorithm is of the O(mn) while that of the proposed threshold based resource allocation technique is O(m).
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 63 REFERENCES
Subsystems of Processes with Deadlock Avoidance
  • D. Lomet
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1980
TLDR
It is shown how the subsystem approach can be applied systematically so as to approximate FIFO scheduling of resource requests, while avoiding deadlock and indefmite delay.
Prevention of system deadlocks
TLDR
Algorithms are presented which examine a request in the light of the current allocation of resources and determi whether or not the granting of the request will introduce the possibility of a deadlock.
Deadlock avoidance revisited
TLDR
The deadlock-prediction problem for a set of processes using locks is reduced to a new np-complete problem, and thedeadlock-avoidance problem for processes with branches is shown to be pspace-complete.
Testing Deadlock-Freedom of Computer Systems
TLDR
The problem of determining whether it is possible for a set of “free-running” processes to become deadlocked is considered and an algorithm employing a network flow technique is presented for this purpose.
Deadlock Prediction: Easy and Difficult Cases
The subject of this paper is the computational complexity of the deadlock prediction problem for resource allocation. This problem is the question “Is deadlock avoidable?” i.e. “Is there a feasible
Deadlock-Free Systems for a Bounded Number of Processes
TLDR
The resource manager uses the "expedient policy" in granting requests for resources, under the constraint that at most K (a constant) processes can reside in the system at any time.
A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs
TLDR
A family of non-two-phase locking protocols for database systems that are accessed concurrently by a number of independent asychronously running transactions are developed to ensure serializability and deadlock-freedom.
A polynomial-time test for the deadlock-freedom of computer systems
  • T. Kameda
  • Computer Science
    Theoretical Computer Science
  • 1977
We call a system of n processes sharing m reusable resources deadlock-free, if and only if the allocation policy which automatically grants any request that can be granted with currently free
Comment on deadlock preventive method
TLDR
It is found a bit misleading to apply the appellation "perma-nent blocking" to a condition which under fortuitous circumstances might resolve itself, and the term "indefinite postponement" is preferred.
Locking and Deadlock Detection in Distributed Data Bases
TLDR
Two protocols for the detection of deadlocks in distributed data bases are described–a hierarchically organized one and a distributed one that requires that the global graph be built and maintained in order for deadlocks to be detected.
...
1
2
3
4
5
...