Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Sharing Memory with SemiByzantine Clients and Faulty Storage Servers Hagit Attiya
 

Summary: Sharing Memory with Semi­Byzantine Clients and Faulty Storage Servers
Hagit Attiya
Department of Computer Science, Technion
hagit@cs.technion.ac.il
Amir Bar­Or
Department of Computer Science, Technion
and HP ESDM Laboratory, Haifa
abaror@cs.technion.ac.il
Abstract
This paper presents several fault­tolerant simulations of
a single­writer multi­reader regular register in storage sys­
tems. One simulation tolerates fail­stop failures of storage
servers and require a majority of nonfaulty servers, while
the other simulation tolerates Byzantine failures and re­
quires that two­thirds of the servers to be nonfaulty. A con­
struction 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 fail­
stop or Byzantine failures of storage servers.

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences