Skip to main content

Deadlocks

  • Reference work entry
Encyclopedia of Parallel Computing

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,799.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

Institutional subscriptions

Bibliography

  1. Belik F (1990) An efficient deadlock avoidance technique. IEEE Trans Computers 39(7):882–888

    Google Scholar 

  2. Brand D, Zafiropulo P (1981) On communicating finite-state machines. IBM Res Report RZ 1053 (#37725)

    Google Scholar 

  3. Bracha G, Toeug S (1987) Distributed deadlock detection. Distrib Comput 2:127–138

    MATH  Google Scholar 

  4. Coffman E, Elphick M, Shoshani A (1971) System deadlocks. Comput Surveys 3:67–78

    MATH  Google Scholar 

  5. Dijkstra E (1965) Cooperating sequential processes. Technical Report EWD-123, Technological University, Eindhoven, The Netherlands

    Google Scholar 

  6. Dijkstra E (1977) The mathematics behind the banker’s algorithm. In: Dijkstra EW, published as pages 308–312 of Edsger W. Dijkstra, Selected writings on computing: a personal perspective. Springer, Berlin

    Google Scholar 

  7. Ezpeleta J, Tricas F, Garcia V, Colom J (2002) A banker’s solution for deadlock avoidance in FMS with flexible routing and multiresource states. IEEE Trans Robot Autom 18(4):621–625

    Google Scholar 

  8. Gold E (1978) Deadlock prediction: easy and difficult cases. SIAM J Comput 7(3):320–336

    MATH  MathSciNet  Google Scholar 

  9. Habermann A (1969) Prevention of system deadlocks. Commun ACM 12(7):373–377, 385

    Google Scholar 

  10. Havender J (1968) Avoiding deadlock in multitasking systems. IBM Syst J 7(2):74–84

    Google Scholar 

  11. Holt R (1971) Comments on prevention of system deadlocks. Commun ACM 14(1):36–38

    MATH  Google Scholar 

  12. Holt R (1972) Some deadlock properties of computer systems. ACM Comput Surveys 4:179–196

    MathSciNet  Google Scholar 

  13. Kim J, Koh K (1991) An O(1) time deadlock detection scheme in single unit and single request multiprocess system. In: IEEE TENCON’91, New Delhi, India. pp 219–223

    Google Scholar 

  14. Lang S (1999) An extended banker’s algorithm for deadlock avoidance. IEEE Trans Softw Eng 25(3):428–432

    Google Scholar 

  15. Lee J, Mooney V (2005) Hardware-software partitioning of operating systems: Focus on deadlock detection and avoidance. In: IEE proceedings on computers and digital techniques

    Google Scholar 

  16. Leibfried T (1989) A deadlock detection and recovery algorithm using the formalism of a directed graph matrix. Operating Syst Rev 45–55

    Google Scholar 

  17. Shoshani A, Coffman E (1970) Detection, prevention and recovery from deadlocks in multiprocess, multiple resource systems. In: 4th annual Princeton conference on information sciences and system, Princeton, NJ

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Campbell, R.H. (2011). Deadlocks. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_282

Download citation

Publish with us

Policies and ethics