The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Integrated concurrency control and recovery mechanisms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
Adaptive transaction scheduling
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Quasi-dynamic two-phase locking
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Virtual memory transaction management
ACM SIGOPS Operating Systems Review
Pattern-driven deadlock avoidance
Proceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
| Hi-index | 0.00 |
Deadlock detection is usually considered to be expensive, and timeouts or deadlock prevention techniques are usually resorted to as a result, which many times causes unnecessary transaction restarts. In this paper, we show that under certain reasonable assumptions, deadlocks can be detected very cheaply.