article

Free access

Deadlock detection is cheap

Authors:

Rakesh Agrawal,

Michael J. Carey, and

David J. DeWittAuthors Info & Claims

ACM SIGMOD Record, Volume 13, Issue 2

Pages 19 - 34

https://doi.org/10.1145/984523.984524

Published: 01 January 1983 Publication History

PDF eReader

Abstract

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.

References

[1]

R. Agrawal and D. J. DeWitt, Performance of Integrated Recovery and Concurrency Control Mechanisms, in preparation (1982).]]

Google Scholar

[2]

N. Deo, "Graph Theory with Applications to Engineering and Computer Science," Prentice-Hall, Englewood Cliffs, N. J. (1974).]]

Digital Library

Google Scholar

[3]

J. N. Gray, P. Homan, H. Korth, and R. Obermarck, "A Straw Man Analysis of the Probability of Waiting and Deadlock in a Database System," Rep. RJ3066, IBM Research Lab., San Jose, California (Feb. 1981).]]

Google Scholar

[4]

J. N. Gray, "Notes on Database Operating Systems," in Lecture Notes in Computer Science 60, Advanced Course on Operating Systems, ed. G. Seegmuller, Springer Verlag, New York (1978).]]

Digital Library

Google Scholar

[5]

F. Harary, "Graph Theory," Addison-Wesley, Reading, Massachusetts (1972).]]

Google Scholar

[6]

R. C. Holt, "Some Deadlock Properties of Computer Systems," ACM Computing Surveys 4, 3, pp. 179--196 (Sept. 1972).]]

Digital Library

Google Scholar

[7]

P. F. King and A. J. Collmeyer, "Database Sharing - An Efficient Method for Supporting Concurrent Processes," Proc. AFIPS 1973 Natl. Computer Conf., pp. 271--275 (1973).]]

Google Scholar

[8]

Knuth, D. E., "The Art of Computer Programming: Fundamental Algorithms," Vol. 1, 2nd edition, Addison-Wesley, Reading, Massachusetts (1973).]]

Digital Library

Google Scholar

[9]

G. Newton, "Deadlock Prevention, Detection and Resolution," ACM-SIGOPS Operating Systems Review 13, 4, pp. 33--44 (April 1979).]]

Digital Library

Google Scholar

[10]

M. R. Stonebraker, "Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES," IEEE Trans. Software Eng. SE-5, 3, pp. 188--194 (May 1979).]]

Digital Library

Google Scholar

Cited By

View all

Rahm ESaake GSattler KRahm ESaake GSattler K(2015)SynchronisationsverfahrenVerteiltes und Paralleles Datenmanagement10.1007/978-3-642-45242-0_12(253-284)Online publication date: 23-Jun-2015
https://doi.org/10.1007/978-3-642-45242-0_12
Zeng FGopalakrishnan GFarchi EMercer E(2009)Pattern-driven deadlock avoidanceProceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging10.1145/1639622.1639628(1-8)Online publication date: 19-Jul-2009
https://dl.acm.org/doi/10.1145/1639622.1639628
Helal AKu TFortner J(1994)Quasi-dynamic two-phase lockingProceedings of the third international conference on Information and knowledge management10.1145/191246.191281(211-218)Online publication date: 29-Nov-1994
https://dl.acm.org/doi/10.1145/191246.191281
Show More Cited By

Index Terms

Deadlock detection is cheap
1. Information systems
  1. Data management systems
    1. Database management system engines

Index terms have been assigned to the content through auto-classification.

Recommendations

Deadlock detection is really cheap

The treatment of deadlock has previously been considered as expensive, and implementations of the involved algorithm have appeared rather complex. In this paper a new algorithm for the treatment of deadlock is described. It is not only very efficient (...
Read More
Multithreaded test synthesis for deadlock detection
OOPSLA '14

Designing and implementing thread-safe multithreaded libraries can be a daunting task as developers of these libraries need to ensure that their implementations are free from concurrency bugs, including deadlocks. The usual practice involves employing ...
Read More
Compositional deadlock detection for rendezvous communication
EMSOFT '09: Proceedings of the seventh ACM international conference on Embedded software

Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadlock, absent from sequential programs. Unfortunately, traditional race and ...
Read More

Comments

Information & Contributors

Information

Published In

ACM SIGMOD Record Volume 13, Issue 2

January 1983

57 pages

ISSN:0163-5808

DOI:10.1145/984523

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1983

Published in SIGMOD Volume 13, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
469
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rahm ESaake GSattler KRahm ESaake GSattler K(2015)SynchronisationsverfahrenVerteiltes und Paralleles Datenmanagement10.1007/978-3-642-45242-0_12(253-284)Online publication date: 23-Jun-2015
https://doi.org/10.1007/978-3-642-45242-0_12
Zeng FGopalakrishnan GFarchi EMercer E(2009)Pattern-driven deadlock avoidanceProceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging10.1145/1639622.1639628(1-8)Online publication date: 19-Jul-2009
https://dl.acm.org/doi/10.1145/1639622.1639628
Helal AKu TFortner J(1994)Quasi-dynamic two-phase lockingProceedings of the third international conference on Information and knowledge management10.1145/191246.191281(211-218)Online publication date: 29-Nov-1994
https://dl.acm.org/doi/10.1145/191246.191281
Helal AKu TElmasri RMukherjee S(1993)Adaptive transaction schedulingProceedings of the second international conference on Information and knowledge management10.1145/170088.170462(704-713)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1145/170088.170462
Pyung-Chul Kim Hwan Ik Choi Yoon-Joon Lee Sang Ho Lee Myung-Joon Kim (1992)MIDAS: design philosophy and internalsEleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]10.1109/PCCC.1992.200549(132-139)Online publication date: 1992
https://doi.org/10.1109/PCCC.1992.200549
Young Chul Park Scheuermann PSang Ho Lee (1992)A periodic deadlock detection and resolution algorithm with a new graph model for sequential transaction processing[1992] Eighth International Conference on Data Engineering10.1109/ICDE.1992.213191(202-209)Online publication date: 1992
https://doi.org/10.1109/ICDE.1992.213191
Bukhres OMagel K(1991)Deadlock detection in distributed database systems: a performance evaluation study[1991] Proceedings The Fifteenth Annual International Computer Software & Applications Conference10.1109/CMPSAC.1991.170155(78-83)Online publication date: 1991
https://doi.org/10.1109/CMPSAC.1991.170155
Park YScheuermann P(1991)A deadlock detection and resolution algorithm for sequential transaction processing with multiple lock modes[1991] Proceedings The Fifteenth Annual International Computer Software & Applications Conference10.1109/CMPSAC.1991.170154(70-77)Online publication date: 1991
https://doi.org/10.1109/CMPSAC.1991.170154
Ryu IThomasian A(1990)Analysis of database performance with dynamic lockingJournal of the ACM10.1145/79147.7915237:3(491-523)Online publication date: 1-Jul-1990
https://dl.acm.org/doi/10.1145/79147.79152
Brössler PRosenberg J(1990)Transactions in a Segmented Single Level Store ArchitectureSecurity and Persistence10.1007/978-1-4471-3178-6_23(319-338)Online publication date: 1990
https://doi.org/10.1007/978-1-4471-3178-6_23
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Deadlock detection is really cheap

Multithreaded test synthesis for deadlock detection

Compositional deadlock detection for rendezvous communication

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations