RAYMOND'S TREE BASED ALGORITHM is an        

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 that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication, is called ________
• Which mutual exclusion algorithm is useful when the membership of the group is unknown?
• 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 of the following is an example of election algorithm.
• Suzuki-Kasami's Broadcast Algorithm is an
• Which algorithm requires "1 to ∞" messages to enter and leave a critical region?
• This is not feature of cooperative algorithm
• The dynamic replication algorithm takes into account