An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Hi-index | 0.00 |
We compare performances of two distributed mutual-exclusion algorithms, using Lamport's time stamps. They are due to Ricart and Agrawala for the first and Carvalho and Roucairol for the second. The comparison concerns the number of messages to be emitted and the waiting time added by the algorithms. The study shows the importance of synchronizations. A bad use of time stamps lengthens response times.