Loading...
Please wait, while we are loading the content...
Similar Documents
A Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Swaroop, Abhishek Singh, Awadhesh Kumar |
| Copyright Year | 2008 |
| Abstract | The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case message complexity of the algorithm is n+1. The maximum concurrency and forum switch complexity of the algorithm are n and min (n, m) respectively, where n is the number of processes and m is the number of groups. The algorithm also satisfies another desirable property called smooth admission. The scheme can also be adapted to handle the extended group mutual exclusion problem. Keywords—Dynamic request sets, Fault tolerance, Smooth admission, Transient faults. |
| Starting Page | 289 |
| Ending Page | 296 |
| Page Count | 8 |
| File Format | PDF HTM / HTML |
| Volume Number | 2 |
| Alternate Webpage(s) | http://waset.org/publications/2523/a-fault-tolerant-token-based-algorithm-for-group-mutual-exclusion-in-distributed-systems |
| Alternate Webpage(s) | http://www.waset.org/journals/waset/v38/v38-34.pdf |
| Alternate Webpage(s) | http://www.waset.org/journals/ijece/v3/v3-10-99.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
