Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 3 - Operating Systems - Chapter Review Problems - Page 165: 37

Answer

No

Work Step by Step

No, deadlock cannot occur in such a system. This resource allocation strategy is known as a resource hierarchy or resource classification, where a process is required to acquire resources in a specific order. This approach prevents circular wait, which is one of the necessary conditions for deadlock. In this system, a process must first acquire all required level 1 resources before moving on to request level 2 resources, and so on. This strict order of acquiring resources eliminates the possibility of circular wait, ensuring that resources are acquired in a way that avoids the formation of circular dependency chains, and therefore, deadlock cannot occur.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.