adplus-dvertising
frame-decoration

Question

Which are the two complementary deadlock-prevention schemes using time stamps ?

a.

The wait-die & wound-wait scheme

b.

The wait-n-watch scheme

c.

The wound-wait scheme

d.

The wait-wound & wound-wait scheme

Posted under Operating System

Answer: (a).The wait-die & wound-wait scheme

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which are the two complementary deadlock-prevention schemes using time stamps ?

Similar Questions

Discover Related MCQs

Q. What are the parts of global unique identifier ?

Q. What are the disadvantages of majority protocol ?

Q. Single coordinator approach has the following disadvantages :

Q. Single coordinator approach has the following advantages :

Q. What things are transaction coordinator is responsible for ?

Q. What is the characteristics of atomicity ?

Q. What are the advantages of token(with rings) passing approach ?

i) One processor as coordinator which handles all requests
ii) No starvation if the ring is unidirectional
iii) There are many messages passed per section entered if few users want to get in section
iv) One processor as coordinator which handles all requests
v) Only one message/entry if everyone wants to get in

Q. What are the characteristics of fully distributed approach ?

i) When responses are received from all processes, then process can enter its Critical Section
ii) When process exits its critical section, the process sends reply messages to all its deferred requests.
iii) It requires request,reply and release per critical section entry
iv) One processor as coordinator which handles all requests

Q. What are the characteristics of mutual exclusion using centralized approach ?

Q. What are the characteristics of tightly coupled system ?

i) Different clock
ii) Use communication links
iii) Same clock
iv) Distributed systems

Q. According to the ring algorithm, links between processes are

Q. In distributed systems, election algorithms assumes that

Q. In case of failure, a new transaction coordinator can be elected by

Q. In distributed systems, transaction coordinator

Q. In the token passing approach of distributed systems, processes are organized in a ring structure

Q. For proper synchronization in distributed systems

Q. A process can enter into its critical section

Q. If a process is executing in its critical section

Q. If timestamps of two events are same, then the events are

Q. In distributed systems, a logical clock is associated with