Name
Abstract | ||
|---|---|---|
This article presents a fault tolerant extension for the Naimi-Trehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in which token requests would have been satisfied had the failure not occurred. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11549468_72 | Euro-Par |
Keywords | Field | DocType |
token request,failure recovery,mutual exclusion algorithm,fault tolerant extension,dynamic tree,broadcast support,good fairness,original algorithm,fault tolerant,mutual exclusion,satisfiability | Broadcasting,Suzuki-Kasami algorithm,Token passing,Computer science,Queue,Critical section,Parallel computing,Algorithm,Fault tolerance,Security token,Mutual exclusion,Distributed computing | Conference |
Volume | ISSN | ISBN |
3648 | 0302-9743 | 3-540-28700-0 |
Citations | PageRank | References |
8 | 0.54 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julien Sopena | 1 | 140 | 18.04 |
| Luciana Arantes | 2 | 220 | 37.48 |
| Marin Bertier | 3 | 382 | 24.31 |
| Pierre Sens | 4 | 526 | 51.65 |