|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
1992 Fourth IEEE Symposium on Parallel and Distributed Processing
A token based distributed k mutual exclusion algorithm
Arlington, TX, USA
December 01-December 02
ISBN: 0-8186-3200-3
| ASCII Text | x | ||
| Makki, Banta, Been, Pissinou, Park, "A token based distributed k mutual exclusion algorithm," Parallel and Distributed Processing, IEEE Symposium on, pp. 408-411, 1992 Fourth IEEE Symposium on Parallel and Distributed Processing, 1992. | |||
| BibTex | x | ||
| @article{ 10.1109/SPDP.1992.242717, author = { Makki and Banta and Been and Pissinou and Park}, title = {A token based distributed k mutual exclusion algorithm}, journal ={Parallel and Distributed Processing, IEEE Symposium on}, volume = {0}, year = {1992}, isbn = {0-8186-3200-3}, pages = {408-411}, doi = {http://doi.ieeecomputersociety.org/10.1109/SPDP.1992.242717}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel and Distributed Processing, IEEE Symposium on TI - A token based distributed k mutual exclusion algorithm SN - 0-8186-3200-3 SP408 EP411 A1 - Makki, A1 - Banta, A1 - Been, A1 - Pissinou, A1 - Park, PY - 1992 KW - token based distributed k mutual exclusion algorithm KW - nonzero semaphore KW - zero semaphore KW - release message VL - 0 JA - Parallel and Distributed Processing, IEEE Symposium on ER - | |||
The authors present an algorithm for solving the k mutual exclusion problem in a distributed system. The algorithm is token based, whereby a token is passed among sites. Only sites that either receive the token with a nonzero semaphore or receive the token with a zero semaphore and later receive a release message from a previous site are allowed to enter their critical sections. Attached to the token is a queue which lists the sites scheduled to receive the token and a general semaphore. In all cases except extremely light token request traffic, the number of messages per critical section execution can be expressed as a small constant. This constant approaches three in an extremely heavy token request environment.
Index Terms:
token based distributed k mutual exclusion algorithm, nonzero semaphore, zero semaphore, release message
Citation:
Makki, Banta, Been, Pissinou, Park, "A token based distributed k mutual exclusion algorithm," spdp, pp.408-411, 1992 Fourth IEEE Symposium on Parallel and Distributed Processing, 1992
Usage of this product signifies your acceptance of the Terms of Use.