Abstract
The problem of implementing self-stabilizing timestamps with bounded values is investigated and a solution is found which is applied to the ℓ-exclusion problem and to the Multiwriter Atomic Register problem. Thus we get self-stabilizing solutions to these two well-known problems. A new type of weak timestamps is identified here, and some evidence is brought to show its usefulness.
| Original language | English |
|---|---|
| Pages (from-to) | 449-515 |
| Number of pages | 67 |
| Journal | Theoretical Computer Science |
| Volume | 308 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - 3 Nov 2003 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science