The Community for Technology Leaders
Green Image
A heuristically-aided algorithm to achieve mutual exclusion in distributed systems is presented which has better performance characteristics than previously proposed algorithms. The algorithm makes use of state information, which is defined as the set of states of mutual exclusion processes in the system. Each site maintains information about the state of other sites and uses it to deduce a sub
failure recovery methods; algorithm performance; low traffic; heuristic techniques; heuristically-aided algorithm; mutual exclusion; distributed systems; state information; token; messages; critical section invocation; random variable; site crash; communication-medium failure; simulation technique; analytic technique; heavy traffics; requests; critical section execution; distributed processing; packet switching.
M. Singhal, "A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems", IEEE Transactions on Computers, vol. 38, no. , pp. 651-662, May 1989, doi:10.1109/12.24268
106 ms
(Ver 3.1 (10032016))