Question: 1. Explain the different RPC semantics and how they can be implemented : at-most-once, exactly-once, at-least-once. 2. Given an example to show where direct dependency
1. Explain the different RPC semantics and how they can be implemented : at-most-once, exactly-once, at-least-once.
2. Given an example to show where direct dependency clocks fail to capture causality.
3. Modify Lamport's mutual exclusion algorithm to support reader-writer locks. That is, multiple concurrent readers are OK as long there are no writers.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
