Consider the following resource-allocation policy. Requests and releases for resources are allowed at any time. If a
Question:
For example, consider a system with three resource types and the vector Available initialized to (4, 2, 2). If process P0 asks for (2, 2, 1), it gets them. If P1 asks for (1, 0, 1), it gets them. Then, if P0 asks for (0, 0, 1), it is blocked (resource not available). If P2 now asks for (2, 0, 0), it gets the available one (1, 0, 0) and one that was allocated to P0 (since P0 is blocked). P0’s Allocation vector goes down to (1, 2, 1), and its Need vector goes up to (1, 0, 1). a. Can deadlock occur? If so, give an example. If not, which necessary condition cannot occur?
b. Can indefinite blocking occur?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Financial Reporting and Analysis Using Financial Accounting Information
ISBN: 978-1439080603
12th Edition
Authors: Charles H Gibson
Question Posted: