Sharing memory with semi-Byzantine clients and faulty storage servers
- 2 March 2004
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents several fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers and require a majority of nonfaulty servers, while the other simulation tolerates Byzantine failures and requires that two-thirds of the servers to be nonfaulty. A construction of Afek et al.(1995) 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 failstop or Byzantine failures of storage servers.Keywords
This publication has 14 references indexed in Scilit:
- Active disks for large-scale data processingComputer, 2001
- Active disksPublished by Association for Computing Machinery (ACM) ,1998
- The part-time parliamentACM Transactions on Computer Systems, 1998
- Byzantine quorum systemsPublished by Association for Computing Machinery (ACM) ,1997
- 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
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974