A Solutions Manual for Operating Systems A Concept-Based by Dhananjay M. Dhamdhere

By Dhananjay M. Dhamdhere

Show description

Read or Download A Solutions Manual for Operating Systems A Concept-Based Approach Second Edition PDF

Best nonfiction_5 books

Extra resources for A Solutions Manual for Operating Systems A Concept-Based Approach Second Edition

Example text

When this process completes, resources released by it can be allocated to the other processes, so all processes can complete. Problem 4: A process Pi is permitted to wait only for an older process. Thus, it is not possible to have a circular wait-for relationship. Hence deadlocks cannot arise. Completion of every process in finite time can be shown as follows: The oldest process in the system is guaranteed any resource it needs, hence it is guaranteed to complete. Now, the second oldest process can complete, if not already done, and so on.

Following Problem 20, Part (b), no deadlocks can arise. Problem 22: A consumer waits on buff full only if full is 0. signal after incrementing full only if the new value of full is 1. signal only if the new value of full is n − 1. Problem 23: From the code for a process, delete the statements to perform an I/O operation and invoke procedure IO complete. wait. It should be followed by code that performs the I/O operation on the track track no, which should be followed by the code that is present in procedure IO complete.

Problem 24: (a) The reservations data would become data of the monitor. Bookings and Cancellations would be monitor procedures. (b) The monitor provides mutual exclusion between executions of its procedures; no additional synchronization would be necessary. Use of CR or CCR would yield a similar implementation. Problem 25: The monitor should have a variable to hold the value n, an appropriate number of condition variables as explained in the following, and a data structure to Process Synchronization 43 hold pending debits.

Download PDF sample

Rated 4.98 of 5 – based on 36 votes