DocumentCode
968645
Title
Token systems that self-stabilize
Author
Brown, Geoffrey M. ; Gouda, Mohamed G. ; Wu, Chuan-lin
Author_Institution
Texas Univ., Austin, TX, USA
Volume
38
Issue
6
fYear
1989
fDate
6/1/1989 12:00:00 AM
Firstpage
845
Lastpage
852
Abstract
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 are better than previous systems in that their state transitions are noninterfering; i.e., if any state transition is enabled at any instant, then it will continue to be enabled until it is executed. This makes the systems easier to implement as delay-insensitive circuits
Keywords
operating systems (computers); protocols; critical section; mutual exclusion systems; self-stabilizing; state transitions; token; Circuits; Delay; Fault detection; Fault tolerance; Fault tolerant systems; Hardware; Local area networks; Protocols; Robustness;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.24293
Filename
24293
Link To Document