Design and implementing a software tool to ensure undeadlock state by perfect distribution of resources' instances among competing processes

  • Authors

    • Imad Matti Bakko Al mamon university college
    • Ruwaida Mohammed Yas
    2015-07-03
    https://doi.org/10.14419/jacst.v4i2.4857
  • Operating Systems Deadlock, Software Tool, Safety Algorithm, Processes, Resources.

  • Abstract

    In computer operating systems books, they explain and solve deadlock problems by declaring in advance the maximum needs of resources and their instances for each process, the total number of resources' instances, and the allocation of the resources' instances for each process. In this paper, we introduce an effective software tool to prove that it is not necessary to declare in advance the allocation of resources' instances for each process since we suggested and implement in the tool some equations to calculate and discover a suitable allocation of resources' instances to be distributed among competing processes in such a way that the computer system will never enter a deadlock state. In fact, the only necessary and sufficient conditions to solve deadlock problems are the total number of resources and their instances besides the maximum needs of resources and their instances for each process. The theory and details are explained with some examples in the contents.

  • References

    1. [1] Abraham Silberschatz , Peter Baer Galvin , Greg Gagne" Operating System Concepts " , 9th edition , chapter 7, deadlock, pages 318-322, copyright 2013 by John Wiley & Sons , Inc. Printed in the United State of America.

      [2] Abraham Silberschatz, James L. Peterson "Operating System Concepts", 2nd edition, chapter 8 deadlock, pages 285, 288. Copyright 1985 by Addison-Wesley publishing company. Inc. printed in the United State of America.

      [3] Andrew S. Tanenbaum "Modern Operating Systems", 3rd Edition, 2009, chapter 6 deadlock, page 436. Pearson Prentice Hall, Pearson Education, Inc. Printed in the United State of America.

      [4] Harvey M. Deitel "An Introduction to Operating Systems", Chapter 6 Deadlock, page 131, Addision-Wesley. Publishing Company 3rd Edition, 1990.

      [5] Ann mciver mchoes and ida m. Flynn "Understanding Operating Systems", chapter 5 processing management, deadlock, page 141, seventh edition, 2014 CENGAGE Learing, printed in the United State of America.

      [6] J Archer Harris "Schaum's Outline of Operating System", New York, McGraw-Hill, 2002.

      [7] www.googlechrome.com, [PDF] Abraham silberschatz, Peter Baer Galvin, and Greg Gagne, “Operating System Concepts " , 7th Edition , copyright 2005 by John Wiley & Sons , Inc. Printed in the United State of America.

      [8] www.googlechrome.com, Deadlock operating systems," [PDF] ch5 deadlock pdf.

      [9] www.googlechrome.com, Deadlock operating systems," [PDF] cos 318: operating system deadlock Princeton University "Andy Bavier Computer Science Department Princeton University http://www.cs.princeton.ed/cources/archive/fall10/cos318/lectures/deadlock.pdf.

      [10] Www.googlechrome.com. Deadlock operating systems," [PDF] operating systems deadlocks ", Jerry Breecher.

      [11] www.googlechrome.com. Deadlock operating systems," deadlock-wikipedia, the free encyclopedia ", https://en.wikipedia.org/wiki/deadlock.

      [12] Www.googlechrome.com. Deadlock operating systems", [PDF] os chp8 deadlocks pdf ".

  • Downloads

  • How to Cite

    Bakko, I. M., & Yas, R. M. (2015). Design and implementing a software tool to ensure undeadlock state by perfect distribution of resources’ instances among competing processes. Journal of Advanced Computer Science & Technology (JACST), 4(2), 237-247. https://doi.org/10.14419/jacst.v4i2.4857

    Received date: 2015-05-30

    Accepted date: 2015-06-21

    Published date: 2015-07-03