Extend Lamport's Algorithm for k-mutual exclusion problem, which allows at most k processes enter the critical section at the same time.
Extend Lamport's
In informatics, mutual exclusion is a characteristic of competitive regulation created to prevent racial circumstances.
Regarding a time period in which a thread accesses a shared resource shared data object, shared services, shared stored memory, etc., it is necessary that a thread is only used in a crucial area, while a parallel thread already accesses a crucial part.
A data object that attempts to change two or more concurrent threads is considered to be in the critical segment if two concurrent read operations are permitted but not two concurrent writes operations or if it is allowed to simultaneously read and write without causing data confusion.
Step by step
Solved in 4 steps
