For each critical section (CS) execution, maekawaâ€™s algorithm – McqOptions

MCQOPTIONS

An error occurred while fetching the topics. Please try again later.

1.	For each critical section (CS) execution, maekawaâ€™s algorithm requires Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â messages per CS execution and the Synchronization delay in the algorithm is Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .
A.	âˆšn , t
B.	2âˆšn , t
C.	3âˆšn , t
D.	3âˆšn , 2t
Answer» E.

Discussion

No Comment Found

Related MCQs

A glue between client and server parts of application
Internet provides for remote login.
provides programmers a familiar programming model by extending the local procedure call to a distributed environment
is an object acting as a gateway for the client side.
What are the advantages of token(with rings) passing approach?i) One processor as coordinator which handles all requestsii) No starvation if the ring is unidirectionaliii) There are many messages passed per section entered if few users want to get in sectioniv) One processor as coordinator which handles all requestsv) Only one message/entry if everyone wants to get in
consistency is that write operations by the same process are performed in the correct order everywhere.
In receivers never acknowledge the successful delivery of multicast message but instead report only when missing the message.
A problem with the protocol is that when the coordinator has crashed, participants may not be able to reach a final decision.
Which algorithm requires "1 to " messages to enter and leave a critical region?
For each critical section (CS) execution, Ricart-Agrawala algorithm requires messages per CS execution and the Synchronization delay in thealgorithm is .