On the availability of non-strict quorum systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3724 LNCS, Issue , 2005, Pages 48-62

  Aiyer, Amitanand ^a   Alvizi, Lorenzo ^a   Bazzi, Rida A ^b  

^a University of Texas at Austin   (United States)

^b Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAILURE FREQUENCY; K-ATOMICITY; QUORUM SYSTEMS;

CLIENT SERVER COMPUTER SYSTEMS; DATA ACQUISITION; FAILURE ANALYSIS; NETWORK PROTOCOLS; PROBABILITY; SERVERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646401098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_6     Document Type: Conference Paper

References (21)

1. D. S. Amr El Abbadi and F. Cristian. An efficient and fault-tolerant protocol for replicated data management. In Proc. PODS, 1985.
2. D. S. Amr El Abbadi and F. Cristian. Maintaining availability in partioned replicated databases. In Proc. PODS, 1986.
3. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In Proc. 18th SOSP, pages 131-145, 2001.
4. D. L. Eager and K. C. Sevcik. Achieving robustness in distributed database systems. ACM Trans. Database Syst., 8(3):354-381, 1983.
5. A. Fox and E. A. Brewer. Harvest, yield and scalable tolerant systems. In Wkshp on Hot Topics in Op Sys, pages 174-178, 1999.
6. D. K. Gifford. Weighted voting for replicated data. In Proc. 7th SOSP, pages 150-162, New York, NY, USA, 1979. ACM Press.
7. R. G. Guy, J. S. Heidemann, W. Mak, T. W. Page, Jr., G. J. Popek, and D. Rothmeir. Implementation of the Ficus Replicated File System. In Proceedings of the Summer 1990 USENIX Conference, pages 63-71, June 1990.
8. N. Krishnakumar and A. J. Bernstein. Bounded ignorance in replicated systems. In Proc. PODS, pages 63-74, New York, NY, USA, 1991. ACM Press.
9. L. Lamport. On interprocess communication, part i: Basic formalism. Distributed Computing, 1(2):77-101, 1986.
10. H. Lee and J. L. Welch. Randomized registers and iterative algorithms. Distributed Computing, 17(3):209-221, 2005.
11. D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Inf. Comput., 170(2):184-206, 2001.
12. J.-P. Martin, L. Alvisi, and M. Dahlin. Small Byzantine quorum systems. In DSN, pages 374-383, June 2002.
13. M. Naor and A. Wool. The load, capacity, and availability of quorum systems. SIAM Journal on Computing, 27(2):423-447, 1998.
14. D. Peleg and A. Wool. The availability of quorum systems. Inf. Comput., 123(2):210-223, 1995.
15. K. Petersen, M. J. Spreitzer, D. B. Terry, M. M. Theimer, and A. J. Demers. Flexible update propagation for weakly consistent replication. In Proc. 16th SOSP, 1997.
16. C. Pu and A. Leff. Replica control in distributed systems: An asynchronous approach. In SIGMOD Conference, pages 377-386, 1991.
17. M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel, and D. C. Steere. Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers, 39(4):447-459, 1990.
18. D. Skeen and D. D. Wright. Increasing availability in partitioned database systems. In Proc. PODS, pages 290-299, New York, NY, USA, 1984. ACM Press.
19. H. G.-M. Susan Davidson and D. Skeen. Consistency in partioned network. Computing Survey, 17(3), 1985.
20. H. Yu. Signed quorum systems. In Proc. 23rd PODC, pages 246-255. ACM Press, 2004.
21. H. Yu and A. Vahdat. The costs and limits of availability for replicated services. In Proc. 18th SOSP, pages 29-42, 2001.