Synchronous Byzantine quorum systems

Distributed Computing

Volumn 13, Issue 1, 2000, Pages 45-52

  Bazzi, Rida A ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; SET THEORY;

SYNCHRONOUS BYZANTINE QUORUM SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033894460     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050004     Document Type: Article

References (22)

1. D. Agrawal, A. El-Abbadi: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans Comput Syst 9(1): 1-20 (1991)
2. R. A. Bazzi: Planar Quorums. In: Proceedings of the 10th International Workshop on Distributed Algorithms, p 251-268, October 1996
3. R. A. Bazzi: Synchronous Byzantine quorum systems. In: Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC), p 259-266, August 1997
4. H. Garcia-Molina, D. Barbara: How to assign votes in a distributed system. Journal of the ACM, 32(4): 481-860 (1985)
5. D. K. Gifford: Weighted Voting for Replicated Data. Proceeding of 7th ACM Symposium on Operating Systems Principles, p 150-162, December 1979
6. A. A. Helal, A. A. Heddaya, B. B. Bhargava: Replication techniques in distributed systems. Kluwer 1996
7. M. P. Herlihy: Replication Methods for Abstract Data Types. Ph.D. Thesis, Massachusetts Institute of Technology, 1984
8. T. Ibaraki, T. Kameda: A theory of Coteries: Mutual Exclusion in Distributed Systems. IEEE Trans Parallel Distrib Syst 4(7): 779-749 (1993)
9. A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Trans Comput 40(9): 996-1004 (1991)
10. A. Kumar, M. Rabinovich, R. Sinha: A performance study of general grid structures for replicated data. In: Proceedings of International Conference on Distrib Comput Systems, p 178-185, May, 1993
11. L. Lamport: On interprocess Communication. Distrib Comput 1: 76-101 (1986)
12. M. Maekawa: A √n algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 3(2): 145-159 (1985)
13. D. Malkhi, M. Reiter: Byzantine Quorum Systems. Distrib Comput 11(4): 203-213 (1998)
14. D. Malkhi, M. Reiter, A. Wool: The load and availability of Byzantine quorum systems. In: Proceedings of the Sixteenth ACM Symposium on Principles of Distributed Computing, August, 1997
15. S. J. Mullender, P. M. B. Vitanyi: Distributed Match Making. Algorithmica 3: 367-391 (1992)
16. M. L. Neilsen: Quorum Structures in Distributed Systems. Ph.D. Thesis, Department of Computer and Information Sciences, Kansas State University, 1992
17. M. L. Neilsen, M. Mizuno: Decentralized Consensus Protocols. In: Proceedings of 10th International Phoenix Conference on Computing and Communications, p 257-262 (1991)
18. M. Naor, A. Wool: The load, capacity and ava
19. D. Peleg, A. Wool: How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems. In: Proceedings of the 15th ACM Symposium on Principles of Distrib Comput, p 290-299, 1996
20. D. Peleg, A. Wool: The availability of quorum systems. Inf Comput 123(2): 210-223 (1995)
21. D. Peleg, A. Wool: Crumbling Walls: A class of high availability quorum systems. In: Proceedings of the 14th ACM Symposium on Principles of Distrib Comput, p 120-129, 1995
22. D. Skeen: A quorum-based commit protocol. In: Proceedings of the 6th Berkeley Workshop on Distributed Data Management and Computer Networks, p 69-80, 1982