Objects shared by byzantine processes

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

Volumn 1914, Issue , 2000, Pages 345-359

  Malkhi, Dahlia ^a   Merritt, Michael ^b   Reiter, Michael ^c   Taubenfeldt, Gadi ^d,e  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b AT AND T LABS RESEARCH   (United States)

^c LUCENT TECHNOLOGIES   (United States)

^d OPEN UNIVERSITY OF ISRAEL   (Israel)

^e AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

BYZANTINE FAULT; BYZANTINE PROCESS; CRASH FAULTS; MESSAGE PASSING SYSTEMS; SHARED MEMORY SYSTEM; SHARED OBJECTS;

MESSAGE PASSING;

EID: 27644434751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_23     Document Type: Conference Paper

References (21)

1. P.C. Attie Wait-free Byzantine Agreement. Technical Report NU-CCS-OO-02, College of Computer Science, Northeastern University, May 2000.
2. Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared memory. Journal of the ACM, 42(6):1231-1274, November 1995.
3. G. Bell. Ultracomputers: A teraflop before its time. Comnauinications of the ACM, 35(8):27-47, August 1992.
4. M. Castro and 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. N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444-458, April 1989.
6. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32:374-382, April 1985.
7. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems 11(1):124-149, January 1991.
8. P. Jayanti, T. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, May 1998.
9. P. Jayanti, and S. Toueg. Some results on the impossibility, universality, and decidability of consensus. Proc. of the 6th Int. Workshop on Distributed Algorithms: LNCS, 647, pages 69-84. Springer Verlag, Nov. 1992.
10. M. P. Herlihy and J. M. Wing. Lineadzability: A correctness condition for concurrent objects. A CM Transactions on Programming Languages and Systems 12(3):463-492, July 1990.
11. K. P. Kihlstrom, L. E. Moser and P. M. Melliar-Smith. The SecureRing protocols for securing group communication. In Proceedings of the 31st IEEE Hawaii Int. Conf. on System Sciences, pages 317-326, January 1998.
12. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, JAI Press, 4:163-183, 1987.
13. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans. on Programming Languages and Systems, 7(4):321-359, 1989.
14. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering 12(2): 187-202, March/ April 2000.
15. S. Moran and Y. Wolfsthal. An extended impossibility result for asynchronous complete networks. Info. Processing Letters, 26:141-151, 1987.
16. F. M. Pittelli and H. Garcia-Molina. Reliable scheduling in a TMR database system. ACM Transactions on Computer Systems, 7(1):25-60, February 1989.
17. S. A. Plotkin. Sticky bits and universality of consensus. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 159-175, August 1989.
18. M. K. Reiter. Distributing trust with the Rampart toolkit. Communications of the ACM 39(4):71-74, April 1996.
19. S. K. Shrivastava, P. D. Ezhilchelvan, N. A. Speirs, S. Tao, and A. Tully. Principal features of the VOLTAN family of reliable node architectures for distributed systems. IEEE Trans. on Computers, 41(5):542-549, May 1992.
20. A. S. Tannenbaum, M. F. Kaashoek, and H. E. Balvrije. Parallel programming using shared objects. IEEE Computer, pages 10-19, August 1992.
21. G. Taubenfeld and S. Moran. Possibility and impossibility results in a shared memory environment. Acta Informatics, 33(1):1-20, 1996.