Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Availability of Non-strict Quorum Amitanand Aiyer1
 

Summary: On the Availability of Non-strict Quorum
Systems
Amitanand Aiyer1
, Lorenzo Alvi i1
, and Rida A. Bazzi2
1
Department of Computer Sciences,
The University of Texas at Austin
{anand, lorenzo}@cs.utexas.edu
2
Computer Science and Engineering Department,
Arizona State University,
bazzi@asu.edu
Abstract. Allowing read operations to return stale data with low prob-
ability has been proposed as a means to increase availability in quorums
systems. Existing solutions that allow stale reads cannot tolerate an ad-
versarial scheduler that can maliciously delay messages between servers
and clients in the system and for such a scheduler existing solutions can-
not enforce a bound on the staleness of data read. This paper considers
the possibility of increasing system availability while at the same time

  

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

 

Collections: Computer Technologies and Information Sciences