TY - GEN
T1 - Performance of three distributed mutual exclusion algorithms
AU - You, Lei
AU - Manivannan, D.
PY - 2004
Y1 - 2004
N2 - In distributed systems, for maintaining the integrity of shared resources, concurrent access to shared resources should be synchronized. This problem is knows as critical section problem or mutual exclusion problem. To solve the mutual exclusion problem in distributed systems, many algorithms have been proposed in the literature. These algorithms can be divided into permission-based and token-based. In this paper, three well-known distributed mutual exclusion algorithms are analyzed, and their performance is compared through simulation.
AB - In distributed systems, for maintaining the integrity of shared resources, concurrent access to shared resources should be synchronized. This problem is knows as critical section problem or mutual exclusion problem. To solve the mutual exclusion problem in distributed systems, many algorithms have been proposed in the literature. These algorithms can be divided into permission-based and token-based. In this paper, three well-known distributed mutual exclusion algorithms are analyzed, and their performance is compared through simulation.
KW - Distributed synchronization
KW - Distributed systems
KW - Mutual exclusion
KW - Performance evaluation
UR - https://www.scopus.com/pages/publications/12344271403
UR - https://www.scopus.com/pages/publications/12344271403#tab=citedBy
M3 - Conference contribution
AN - SCOPUS:12344271403
SN - 1932415262
SN - 9781932415261
T3 - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
SP - 462
EP - 468
BT - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
A2 - Arabnia, H.R.
T2 - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
Y2 - 21 June 2004 through 24 June 2004
ER -