Self-stabilizing timestamps

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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 languageEnglish
Pages (from-to)449-515
Number of pages67
JournalTheoretical Computer Science
Volume308
Issue number1-3
DOIs
StatePublished - 3 Nov 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Self-stabilizing timestamps'. Together they form a unique fingerprint.

Cite this