The Community for Technology Leaders
Green Image
A dynamic information-structure mutual exclusion algorithm is presented for distributed systems whose information-structure evolves with time as sites learn about the state of the system through messages. An interesting feature of the algorithm is that it adapts itself to heterogeneous or fluctuating traffic conditions to optimize the performance (the number of messages exchanged). The performance of the algorithm is studied by simulation technique and compared to the performance of a well-known mutual exclusion algorithm. The impact message loss and site failures on the algorithm is discussed and methods to tolerate these failures are proposed.
Index Termsdynamic information-structure; mutual exclusion algorithm; distributed systems; trafficconditions; impact message loss; site failures; distributed processing

M. Singhal, "A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 3, no. , pp. 121-125, 1992.
93 ms
(Ver 3.3 (11022016))