SHARING MEMORY WITH SEMI-BYZANTINE CLIENTS AND FAULTY STORAGE SERVERS
- 1 December 2006
- journal article
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 16 (4), 419-428
- https://doi.org/10.1142/s0129626406002745
Abstract
This paper presents fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers and requires a majority of nonfaulty servers, while the other simulation tolerates Byzantine failures and assumes that two-thirds of the servers are nonfaulty. A construction of Afek et al. [3] is used to mask semi-Byzantine failures of clients that result in erroneous write operations. The simulations are used to derive Paxos algorithms that tolerate semi-Byzantine failures of clients as well as fail-stop or Byzantine failures of storage servers.Keywords
This publication has 15 references indexed in Scilit:
- Byzantine disk paxos: optimal resilience with byzantine shared memoryDistributed Computing, 2005
- Active Disk Paxos with infinitely many processesDistributed Computing, 2005
- Disk PaxosDistributed Computing, 2003
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Computing with faulty shared objectsJournal of the ACM, 1995
- Sharing memory robustly in message-passing systemsJournal of the ACM, 1995
- On interprocess communicationDistributed Computing, 1986
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974