• retagged by
2,946 views
2 2 votes

Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?

  1. In deadlock prevention, the request for resources is always granted if resulting state is safe.
  2. In deadlock avoidance, the request for resources is always granted. if the resulting state is safe.
  3. Deadlock avoidance requires knowledge of resource requirements a priori.
  4. Deadlock prevention is more restrictive than deadlock avoidance.

2 Answers

Best answer
4 4 votes

Deadlock prevention tries to break one of the four necessary conditions of deadlock. It may reject resource requests even if the resulting state is safe in order to break necessary condition.

Eg: ordering of resources may reject some requests even though they are safe

  • Prevention is similar to a traffic light while avoidance is similar to a police officer directing traffic
  • Deadlock avoidance is less strict than deadlock prevention. It allows mutual exclusion, wait and hold, no preemption, but prevents circular wait. Deadlock avoidance only checks safe states. The request for resources is always granted if the resulting state is safe

Option A is false, all other options are true

• selected by
Answer:
Position:
Show:

Related questions

5 5 votes
3 answers 3 answers
2.1k
2.1k views
gatecse asked Dec 17, 2017
2,106 views
Consider a disk sequence with $100$ cylinders. The request to access the cylinder occur in the following sequence :$4,34,10,7,19,73,2,15,6,20$Assuming that the head is cu...
2 2 votes
2 answers 2 answers
2.4k
2.4k views
gatecse asked Dec 17, 2017
2,358 views
Which of the following is false?User level threads are not scheduled by the kernel.Context switching between user-level threads is faster than context switching between k...
3 3 votes
2 2 answers
1.7k
1.7k views
gatecse asked Dec 17, 2017
1,713 views
A system uses $FIFO$ policy for page replacement.It has $4$ page frames with no pages loaded,to begin with.The system first accesses $50$ distinct pages in some order and...
0 0 votes
2 answers 2 answers
2.5k
2.5k views
gatecse asked Dec 17, 2017
2,489 views
Consider the following scheduling: A.Gang schedulings.Guaranteed schedulingB.Rate monotonic schedulingt.Thread schedulingC.Fair share schedulingu.Real-time schedulingMatc...