loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Token Systems That Self-Stabilize
June 1989 (vol. 38 no. 6)
pp. 845-852
ASCII Text
x 
 
G.M. Brown, M.G. Gouda, C.-L. Wu, "Token Systems That Self-Stabilize," IEEE Transactions on Computers, vol. 38, no. 6, pp. 845-852, June, 1989.
 
 
BibTex
x
 
@article{ 10.1109/12.24293,
author = {G.M. Brown and M.G. Gouda and C.-L. Wu},
title = {Token Systems That Self-Stabilize},
journal ={IEEE Transactions on Computers},
volume = {38},
number = {6},
issn = {0018-9340},
year = {1989},
pages = {845-852},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.24293},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Token Systems That Self-Stabilize
IS - 6
SN - 0018-9340
SP845
EP852
EPD - 845-852
A1 - G.M. Brown,
A1 - M.G. Gouda,
A1 - C.-L. Wu,
PY - 1989
KW - mutual exclusion systems; token; critical section; self-stabilizing; state transitions; operating systems (computers); protocols.
VL - 38
JA - IEEE Transactions on Computers
ER -
 
Presents a novel class of mutual exclusion systems, in which processes circulate one token, and each process enters its critical section when it receives the token. Each system in the class is self-stabilizing; i.e. it it starts at any state, possibly one where many tokens exist in the system, it is guaranteed to converge to a good state where exactly one token exists in the system. The systems

[1] 845G. M. Brown, "Self-stabilizing distributed resource allocation," Ph.D. dissertation, Dep. Elec. Comput. Eng., Univ. of Texas, Austin, 1987.[2] E. Dijkstra, EWD 391, "Self-stabilization in spite of distributed control," 1973; reprinted inSelected Writings on Computing: A Personal Perspective. New York: Springer-Verlag, 1982, pp. 41-46.[3] E. Dijkstra, "Self-stabilizing systems in spite of distributed control,"Commun. ACM, vol. 17, pp. 643-644, 1974.[4] E. W. Dijkstra, "A belated proof to self-stabilization,"Distribut. Comput., vol. 1, pp. 5-6, Jan. 1986.[5] C. A. R. Hoare, "Communicating sequential processes,"Commun. ACM, vol. 21, pp. 666-677, 1978.[6] H. S. M. Kruijer, "Self-stabilization (in spite of distributed control) in tree-structured systems,"Inform. Processing Lett., vol. 8, pp. 91- 95, Feb. 1979.[7] L. Lamport, "Solved problems, unsolved problems, and nonproblems in concurrency," Invited Address, inProc. Third ACM Symp. Principles of Distributed Comput., 1984, pp. 1-11.[8] L. Lamport, "The mutual exclusion problem: Part II--Statement and solutions,"J. ACM, vol. 33, no. 2, pp. 327-348, Apr. 1986.[9] A. J. Martin, "The probe: An addition to communication primitives,"Inform. Processing Lett., vol. 20, pp. 125-130, Apr. 1985.[10] N. Multari, "Self-stabilizing protocols," Ph.D. dissertation, Dep. Comput. Sci., Univ. of Texas at Austin, 1987.[11] C. Seitz, "System timing," inIntroduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1980.

Index Terms:
mutual exclusion systems; token; critical section; self-stabilizing; state transitions; operating systems (computers); protocols.
Citation:
G.M. Brown, M.G. Gouda, C.-L. Wu, "Token Systems That Self-Stabilize," IEEE Transactions on Computers, vol. 38, no. 6, pp. 845-852, June 1989, doi:10.1109/12.24293
Usage of this product signifies your acceptance of the Terms of Use.