Abstract
A mutual exclusion (ME) algorithm consists of a trying protocol (TP)and exit protocol (EP)that surround a critical section (CS)and satisfy the following properties: mutual exclusion : at most one process is allowed to use the CS at a given time; lockout freedom : any process that enters the TP eventually enters the CS; and bounded exit : a process can complete the EP in a bounded number of its own steps. A First-Come-First-Served (FCFS) ME algorithm [1] additionally requires processes to enter the CS in roughly the order in which they start the TP. Once a process has started executing the TP of a ME algorithm, it has committed itself to entering the CS, since the correctness of the algorithm may depend on every process properly completing its TP and EP.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
