by Daniel Vekhter, Alex Rasin, Yuriy Brun
Abstract:
The problem of mutual exclusion is ever-present in distributed networks. Various algorithms have been suggested as a means to solve the problem. This paper discusses the efficiency of three such algorithms --- Test-and-Set bit, Dijkstra's, and Peterson's. The performance of each of the algorithms depends on the number of competing processes and the length of the remainder section. Our experimental results show which of the three algorithms are the most efficient to use depending on the size of the network and the number of remainder steps.
Citation:
Daniel Vekhter, Alex Rasin, and Yuriy Brun, Mutual exclusion algorithms in distributed networks, Journal of Student Research, Science and Technology, vol. 2, no. 1, February 1997, pp. 65–67.
Bibtex:
@article{Vekhter97,
author = {Daniel Vekhter and Alex Rasin and Yuriy Brun},
title = {\href{http://people.cs.umass.edu/brun/pubs/pubs/Vekhter97.pdf}{Mutual
exclusion algorithms in distributed networks}},
journal = {Journal of Student Research, Science and Technology},
venue = {JSRST},
publisher = {Resource Center, Prince George's Community College},
address = {Largo, {MD}, {USA}},
volume = {2},
number = {1},
month = {February},
year = {1997},
pages = {65--67},
abstract = {The problem of mutual exclusion is ever-present in distributed
networks. Various algorithms have been suggested as a means to solve the
problem. This paper discusses the efficiency of three such algorithms ---
Test-and-Set bit, Dijkstra's, and Peterson's. The performance of each of the
algorithms depends on the number of competing processes and the length of the
remainder section. Our experimental results show which of the three algorithms
are the most efficient to use depending on the size of the network and the
number of remainder steps.},
}