Name
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. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1109/12.24293 | Computers, IEEE Transactions |
Keywords | Field | DocType |
operating systems (computers),protocols,critical section,mutual exclusion systems,self-stabilizing,state transitions,token | Token passing,Suzuki-Kasami algorithm,Computer science,Parallel computing,Critical section,Real-time computing,Electronic circuit,Security token,Mutual exclusion,Token bus network,Distributed computing | Journal |
Volume | Issue | ISSN |
38 | 6 | 0018-9340 |
Citations | PageRank | References |
90 | 17.50 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey M. Brown | 1 | 225 | 36.38 |
| M. G. Gouda | 2 | 295 | 40.03 |
| Chuan-lin Wu | 3 | 845 | 183.93 |