Skip to main content

Distributed Deadlock Management

  • Reference work entry
  • First Online:
  • 27 Accesses

Synonyms

Deadlocks in distributed database systems

Definition

In a database that supports locking protocol, accesses to data are controlled using locks. Whenever a transaction needs to access a shared object, it will be granted a lock (and hence access) to the object if there is no other conflicting locks on the object; otherwise, the requesting transaction has to wait. A deadlock occurs when transactions accessing shared data objects are waiting indefinitely in a circular fashion until a special action (such as aborting one of the transactions) is taken. In a distributed database environment, deadlocks can occur locally at a single site, or across sites where a chain of transactions may be waiting for one another to release the locks over a set of shared objects.

For example, consider two data objects o1 and o2 stored at site 1 and site 2 respectively. Suppose two transactions, T1 and T2, initiated at site 1 and site 2, are updating o1 and o2 concurrently. As T1 is updating o1at...

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Abonamah AA, Elmagarmid A. A survey of deadlock detection algorithms in distributed database systems. In: Advances in distributed and parallel processing. System paradigms and methods, vol. 1; 1994. p. 310–41.

    Google Scholar 

  2. Bracha G, Sam T. Distributed deadlock detection. Distrib Comput. 1985;2(3):127–38.

    Article  MATH  Google Scholar 

  3. Chandy KM, Lamport L. Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst. 1986;3(1):63–75.

    Article  Google Scholar 

  4. Elmagarmid AK. A survery of distributed deadlock algorithms. ACM SIGMOD Rec. 1986;15(3):37–45.

    Article  Google Scholar 

  5. Gray J. Notes on data base operating systems. In: Advanced Course: Operating Systems; 1978. p. 393–481.

    Google Scholar 

  6. Ho Gray S, Ramamoorthy CV. Protocols for deadlock detection in distributed database systems. IEEE Trans Softw Eng. 1982;8(6):554–7.

    Google Scholar 

  7. Knapp E. Deadlock detection in distributed databases. ACM Comput Surv. 1987;19(4):303–28.

    Article  Google Scholar 

  8. Krivokapić N, Kemper A, Gudes E. Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis. VLDB J. 1999;8(2):79–100.

    Article  Google Scholar 

  9. Makki K, Pissinou N. Detection and resolution of deadlocks in distributed database systems. In: Proceedings of the International Conference on Information and Knowledge Management; 1995. p. 411–6.

    Google Scholar 

  10. Menascé DA, Muntz R. Locking and deadlock detection in distributed data bases. IEEE Trans Softw Eng. 1997;5(3):195–202.

    Article  MATH  Google Scholar 

  11. Mohan C, Lindsay, Bruce G, Obermarck R. Transaction management in the R* distributed database management system. ACM Trans Database Syst. 1986;11(4):378–96.

    Article  Google Scholar 

  12. Özsu MT, Valduriez P. Principles of distributed database systems. 2nd ed. Upper Saddle River: Prentice-Hall; 1999.

    Google Scholar 

  13. Roesler M, Burkhard WA, Cooper KB. Efficient deadlock resolution for lock-based concurrency control schemes. In: Proceedings of the 18th International Conference on Distributed Computing Systems; 1998. p. 224–33.

    Google Scholar 

  14. Singhal M. Deadlock detection in distributed systems. Computer. 1989;22(11):37–48.

    Article  Google Scholar 

  15. Stonebraker M. The design and implementation of distributed ingres. In: The INGRES papers: anatomy of a relational database system; 1986. p. 187–96.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wee Hyong Tok .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Tok, W.H. (2018). Distributed Deadlock Management. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_711

Download citation

Publish with us

Policies and ethics