Objects shared by Byzantine processes

Distributed Computing

Volumn 16, Issue 1, 2003, Pages 37-48

  Malkhi, Dahlia ^a   Merritt, Michael ^b   Reiter, Michael K ^c   Taubenfeld, Gadi ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b AT AND T LABS RESEARCH   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d NONE

Author keywords

Byzantine faults; Consensus; Emulation; Shared memory

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MIDDLEWARE; THEOREM PROVING; TIME SHARING SYSTEMS;

BYZANTINE FAULTS; CONSENSUS; EMULATION; MESSAGE PASSING; SHARED MEMORY SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037301826     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0075-3     Document Type: Article

References (23)

1. P.C. Attie Wait-free Byzantine Agreement. Technical Report NU-CCS-00-02, College of Computer Science, Northeastern University, May 2000
2. Y. Afek, D. Greenberg, M. Merritt, G. Taubenfeld, Computing with faulty shared memory. Journal of the ACM 42(6): 1231-1274, 1995
3. G. Bell. Ultracomputers: A teraflop before its time. Communications of the ACM 35(8): 27-47, 1992
4. M. Castro, B. Liskov, Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation - OSDI'99, February, 1999, New Orleans, LA
5. S. Chaudhuri, More choices allow more faults: set consensus problems in totally asynchronous systems. Information and Computation 105(1): 132-158, 1993.
6. N. Carriero, D. Gelernter. Linda in context. Communications of the ACM 32(4): 444-458, 1989
7. R. de Prisco, D. Malkhi, M. Reiter. On κ-set Consensus Problems in Asynchronous Systems. IEEE Transactions on Parallel and Distributed Systems 12(1), January 2001
8. M. Fischer, N. Lynch, M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32: 374-382, 1985
9. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems 11(1):124-149, 1991
10. P. Jayanti, T. Chandra, S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM 45(3): 451-500, 1998
11. P. Jayanti, S. Toueg. Some results on the impossibility, universality, and decidability of consensus. Proc. of the 6th Int. Workshop on Distributed Algorithms: LNCS, 647, pp. 69-84. Berlin Heidelberg New York: Springer 1992
12. M. P. Herlihy, J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3): 463-492, 1990
13. K. P. Kihlstrom, L. E. Moser, P. M. Melliar-Smith. The SecureRing protocols for securing group communication. In Proceedings of the 31st IEEE Hawaii Int. Conf. on System Sciences, pp. 317-326, 1998
14. M. C. Loui, H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, JAI Press 4: 163-183, 1987
15. K. Li, P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans. on Programming Languages and Systems 7(4): 321-359, 1989
16. D. Malkhi, M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering 12(2): 187-202, 2000
17. S. Moran, Y. Wolfsthal. An extended impossibility result for asynchronous complete networks. Info. Processing Letters 26: 141-151, 1987
18. F. M. Pittelli, H. Garcia-Molina. Reliable scheduling in a TMR database system. ACM Transactions on Computer Systems 7(1): 25-60, 1989
19. S. A. Plotkin. Sticky bits and universality of consensus. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pp. 159-175, 1989
20. M. K. Reiter. Distributing trust with the Rampart toolkit. Communications of the ACM 39(4): 71-74, 1996
21. S. K. Shrivastava, P. D. Ezhilchelvan, N. A. Speirs, S. Tao, A. Tully. Principal features of the VOLTAN family of reliable node architectures for distributed systems. IEEE Trans. on Computers 41(5): 542-549, 1992
22. A. S. Tannenbaum, M. F. Kaashoek, H. E. Balvrije. Parallel programming using shared objects. IEEE Computer, pp. 10-19, 1992.
23. G. Taubenfeld, S. Moran. Possibility and impossibility results in a shared memory environment. Acta Informatica 33(1): 1-20, 1996