1. Lamport’s Bakery Algorithm
During concurrent computing, multiple threads simultaneously access the same resources on the computer.
This can lead to data inconsistency if two threads access and change data at the same memory location or do this in different sequences.
Using a bakery as the analogy, Lamport developed this algorithm to prevent threads from entering the critical sections of code concurrently.
The algorithm ensures that:
- every process enters the critical section (preventing starvation)
- no two processes are in the critical section at the same time (ensuring mutual exclusion)