According to the ring algorithm, links between processes are ____________

Related MCQs

• In the token passing approach of distributed systems, processes are organized in a ring structure ____________
• RPC works between two processes. These processes may be:
• 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                          .
• 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
• 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?
• Message passing provides a mechanism to allow processes to communicate and to synchronize their actions
• 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
•            is a process that prevents multiple threads or processes from accessing shared resources at the same time.
• In Casual consistency model all processes shared accesses in