An effective "on-line" deadlock detection technique for distributed data base management systems
- 25 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A graph-theoretic model is used to represent the process interactions in DDBMS. From this model a general deadlock detection algorithm is derived, with the important feature of significantly reducing the communication requirements that usually follow the invocation of a deadlock detection mechanism. The idea of "on-line" detection of deadlocks in DDBMS is introduced, and an effective algorithm is presented which detects deadlocks without further delay, at the time of making the data resource allocation decision at the concerned installation. Problems and drawbacks involved in earlier attempts to handle deadlocks in distributed DBMS are provided. Several highlights of our proposals are emphasized, and further possibilities of research are identified.Keywords
This publication has 8 references indexed in Scilit:
- A Survey of Developments in Distributed Data Base Management SystemsComputer, 1978
- Distributed ProcessingComputer, 1978
- Evolution of Data-Base Management SystemsACM Computing Surveys, 1976
- Protocol considerations for software controlled access methods in distributed data basesPublished by Association for Computing Machinery (ACM) ,1976
- Integrity, concurrency, and recovery in databasesPublished by Springer Nature ,1976
- A Survey of Analytic Models of Rollback and Recovery StratergiesComputer, 1975
- Avoiding deadlock in distributed data basesPublished by Association for Computing Machinery (ACM) ,1974
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972