A process can enter into its critical section ____________

Related MCQs

• If a process is executing in its critical section ____________
• 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 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
• Process Fail - Stop in process omission faults
• Any successive write operation by a process on a data item x will be performed on a copy of x that is up to date with the value most recently read by that process.
• 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 ________
• The dynamic replication algorithm takes into account
• Which address is used to identify a process on a host by the transport layer?