Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Recipe for Atomic Semantics for Byzantine Quorum Systems Evelyn Pierce \Lambda Lorenzo Alvisi y
 

Summary: A Recipe for Atomic Semantics for Byzantine Quorum Systems
Evelyn Pierce \Lambda Lorenzo Alvisi y
April 18, 2000
Abstract
We present a formal proof that the problem of atomic semantics [Lam86] for Byzantine quo­
rum systems with trustworthy clients can be reduced to that of regular semantics. Specifically,
any regular protocol for such systems can be combined with a writeback mechanism to produce
an atomic protocol. We then give a pseudo­regular protocol for general masking quorum systems
[MR98a] and show that it can be used in this way to build a pseudo­atomic protocol.
keywords: atomic variable semantics, byzantine fault tolerance, quorum systems,
large­scale data services, calculational proofs
\Lambda Department of Computer Sciences, University of Texas, Austin, Texas; tumlin@cs.utexas.edu.
y Department of Computer Sciences, University of Texas, Austin, Texas; lorenzo@cs.utexas.edu.
1

1 Introduction
Byzantine quorum systems [MR98a] are a promising approach to the problem of efficiently im­
plementing Byzantine fault­tolerant data services. There are several variations on this approach
[Baz97, MRWr97, MRW97, MR98a] but the basic concept is the same: data are maintained si­
multaneously at multiple sites, and each read or write operation is processed at a subset (called a

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences