People have said that proper spooling would have eliminate deadlocks. Certainly, it eliminates from contention card readers, plotters, printers, and so on. It is even possible to spool tapes (called staging them), which would leave the resources of CPU time, memory and disk space. Is it possible to have a deadlock involving these resources? If it is not, why not? What deadlock scheme would seem best to eliminate these deadlocks (if any are possible) or what condition is violated (if they are not possible)?
Answers
Answered by
0
Answer:
It is possible to still have a deadlock. Process P1 holds memory pages that are required by Process P2 while P2 is holding the CPU that is required by P1. The best way to eliminate these types of deadlock is to use preemption.
Thank me later.
Similar questions