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 language | English (US) |
---|---|
Pages (from-to) | 221-227 |
Number of pages | 7 |
Journal | Information Processing Letters |
Volume | 83 |
Issue number | 4 |
DOIs | |
State | Published - Aug 31 2002 |
Externally published | Yes |
Keywords
- Distributed computing
- Fault tolerance
- Wait-freedom
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications