Question

Deadlocks and Banker’s Algorithm

Is the following state safe? Is the following state safe? Suppose there are three processes. A, B, and C, and three resources, a CD-ROM, a printer, and a keyboard. Draw a resource allocation graph showing a deadlock involving all three processes. For each of the following cases, which deadlock-handling mechanism would you use and why? The computer is up for a very long time, the system runs a lot of batch jobs, and the processor is slow. The computer is usually up only for a few hours at a time (e.g., a laptop), and the work being done on it is not critical; however, the processor in the computer is slow. The computer is to remain up for a long time, killing processes is not an option, you have good estimates of how many resources all processes can use, the processes are important, but you have a very fast processor. The computer is up for a very long time, killing processes is not an option, the processes are important, the processor is slow, but, on the bright side, there are few demands on resources.

Answer 1