Which algorithm requires "1 to ∞" messages to enter and leave a critical region?

Related MCQs

• For each critical section (CS) execution, Ricart-Agrawala algorithm requires                         messages per CS execution and the Synchronization delay in the algorithm is                          .
• For each critical section (CS) execution, maekawa’s algorithm requires                         messages per CS execution and the Synchronization delay in the algorithm is                          .
• A process can enter into its critical section ____________
• If processes p and q both receive messages m and m', then p receives m before m' if and only if q receives m before m'.The order delivery is called
• 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
• If a process is executing in its critical section ____________
• A client gets a timestamp of 4:12:30.500 from a time server. The elapsed time between the request and response was 20 msec (0.020 sec). The current time on the client is 4:12:30.510. Using Cristian’s algorithm, what is the time set to on the client?
• Which mutual exclusion algorithm is useful when the membership of the group is unknown?
• Which of the following is an example of election algorithm.
• RAYMOND'S TREE BASED ALGORITHM is an