Skip to main content
SpringerLink
Log in

A Modified Banker’s Algorithm

  • Conference paper
  • First Online:
Innovations and Advances in Computer, Information, Systems Sciences, and Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 152))

Abstract

In this paper, we propose a new algorithm for the classical deadlock avoidance problem. The new algorithm has the simplicity as Banker’s algorithm in terms of data structures used in the algorithm; in particular, there is no graph model of any kind is required. The original Banker’s algorithm has time complexity of O(n 3 d), where n is the number of processes and d is the number of resources (as per certain literatures, it is misquoted as Θ (n 2 d) which refers as the safety check part), in comparison, our algorithm has time complexity of O(n 2 d 2 + ndM), where M is the total number of resource units. When the total resource units are fixed as a constant and number of resource types is fixed, which is a reasonable assumption, the complexity of our algorithm is O(n 2 d 2), a significant improvement over the original Banker’s algorithm. The space-complexity of our algorithm is O(nd2) which is worse than the original Banker’s algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

References

  1. Dijkstra EW (1965) Cooperating Sequential Processes. Technical report, Technological University, Eindhoven, The Netherlands, pp 43–112

    Google Scholar 

  2. Gold EM (1978) Deadlock prediction: easy and dificult cases. SIAM J Comput 7:320–336

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  4. Holt RC (1971) Comments on prevention of system deadlocks. Commun ACM 14(1):179–196

    Article  Google Scholar 

  5. Holt RC (1972) Some deadlock properties of computer systems. Comput Surv 4(3):179–196

    Article  MathSciNet  Google Scholar 

  6. Minura T (1980) Testing deadlock-freedom of computer systems. J ACM 27(2):270–280

    Article  Google Scholar 

  7. Suguyama Y, Araki T, Okui J, Kasami T (1977) Complexity of the deadlock avoidance problem. Trans Inst Electron Comm Eng Jpn J60-D 4:251–258

    Google Scholar 

  8. Silberschatz A, Galvin PB, Gagne G (2002) Operating system concepts. Wiley, New York

    Google Scholar 

  9. Stallings W (1997) Operating systems, internals and design principles. Prentice-Hall, Upper Saddle River

    Google Scholar 

  10. Li Y, Cook R (2007) A new algorithm and asymptotical properties for deadlock detection problem for computer systems with reusable resource types. Advances and innovations in systems, computing sciences and software engineering. Springer, Heidelberg, pp 509–512

    Google Scholar 

  11. Li Y et al (2010) On Dijkstra’s algorithm for deadlock detection. Advanced techniques in computing sciences and software engineering. Springer, Heidelberg, pp 385–387

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Georgia Southern University, Statesboro, GA, 30460, USA

    Youming Li

Authors
  1. Youming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Youming Li .

Editor information

Editors and Affiliations

  1. School of Engineering, University of Bridgeport, University Avenue 221, Bridgeport, 06604, Connecticut, USA

    Khaled Elleithy

  2. School of Engineering, University of Bridgeport, University Avenue 221, Bridgeport, 06604, Connecticut, USA

    Tarek Sobh

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

Li, Y. (2013). A Modified Banker’s Algorithm. In: Elleithy, K., Sobh, T. (eds) Innovations and Advances in Computer, Information, Systems Sciences, and Engineering. Lecture Notes in Electrical Engineering, vol 152. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3535-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-3535-8_23

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-3534-1

  • Online ISBN: 978-1-4614-3535-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation