Name
Abstract | ||
|---|---|---|
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate. The mutual exclusion problem is fundamental in distributed computing, since it allows processors competing to access a shared resource to be able to synchronize and get exclusive access to the resource (i.e. execute their critical section). It is we... |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1093/comjnl/47.3.289 | The Computer Journal |
Keywords | Field | DocType |
critical section,satisfiability,algorithm design,upper bound,distributed computing,mutual exclusion | Synchronization,Suzuki-Kasami algorithm,Computer science,Upper and lower bounds,Critical section,Theoretical computer science,Distributed algorithm,Probabilistic logic,Shared resource,Mutual exclusion,Distributed computing | Journal |
Volume | Issue | ISSN |
47 | 3 | 0010-4620 |
Citations | PageRank | References |
7 | 0.53 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajoy Kumar Datta | 1 | 317 | 40.76 |
| Maria Gradinariu | 2 | 362 | 23.83 |
| Sébastien Tixeuil | 3 | 978 | 93.01 |