Lamport’s algorithm
What is the main purpose of Lamport's algorithm in distributed systems?
How does Lamport's algorithm resolve conflicts when two processes request the critical section simultaneously?
What type of clock does Lamport's algorithm use to order events in a distributed system?
Which of the following is **not** a feature of Lamport's algorithm for mutual exclusion?
In Lamport's algorithm, what must a process do before entering the critical section?
What happens when a process releases the critical section in Lamport's algorithm?
What happens when two processes send requests with identical logical timestamps in Lamport's algorithm?
In Lamport's algorithm, what is the significance of maintaining a request queue at each process?
Why must a process wait for replies from ALL other processes before entering the critical section in Lamport's algorithm?