Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hagit Attiya Articles by Amir Bar-Or

22nd International Symposium on Reliable Distributed Systems (SRDS'03)

Florence, Italy

October 06-October 08

ISBN: 0-7695-1955-5

	ASCII Text	x
	Hagit Attiya, Amir Bar-Or, "Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers," Reliable Distributed Systems, IEEE Symposium on, pp. 371, 22nd International Symposium on Reliable Distributed Systems (SRDS'03), 2003.

	BibTex	x
	@article{ 10.1109/RELDIS.2003.1238090, author = {Hagit Attiya and Amir Bar-Or}, title = {Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers}, journal ={Reliable Distributed Systems, IEEE Symposium on}, volume = {0}, year = {2003}, issn = {1060-9857}, pages = {371}, doi = {http://doi.ieeecomputersociety.org/10.1109/RELDIS.2003.1238090}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Reliable Distributed Systems, IEEE Symposium on TI - Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers SN - 1060-9857 SP EP A1 - Hagit Attiya, A1 - Amir Bar-Or, PY - 2003 KW - null VL - 0 JA - Reliable Distributed Systems, IEEE Symposium on ER -

Hagit Attiya, Technion

Amir Bar-Or, Technion

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RELDIS.2003.1238090

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. [2] 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.

Citation:

Hagit Attiya, Amir Bar-Or, "Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers," srds, pp.371, 22nd International Symposium on Reliable Distributed Systems (SRDS'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.