Wait-free Byzantine consensus

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

The problem of devising wait-free shared memory consensus protocols which tolerate Byzantine processes was studied. The approach was restricted to faults that affect the processes and the shared memory was assumed to be reliable. Results showed that the weak wait-free Byzantine consensus could be achieved only by using 'nonresettable' objects.

Original languageEnglish (US)
Pages (from-to)221-227
Number of pages7
JournalInformation Processing Letters
Volume83
Issue number4
DOIs
StatePublished - Aug 31 2002
Externally publishedYes

    Fingerprint

Keywords

  • Distributed computing
  • Fault tolerance
  • Wait-freedom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this