Sharing memory between Byzantine processes using policy-enforced tuple spaces

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages 35-42

  Bessani, Alysson Neves ^a   Correia, Miguel ^b   Da Silva Fraga, Joni ^a   Lung, Lau Cheuk ^c  

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

^b UNIVERSITY OF LISBON   (Portugal)

^c PONTIFICAL CATHOLIC UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS;

COMPUTING MODELS; FAULT TOLERANT ALGORITHMS;

DATA STORAGE EQUIPMENT;

EID: 33947653758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.76     Document Type: Conference Paper

References (22)

1. N. Alon, M. Merrit, O. Reingold, G. Taubenfeld, and R. Wright. Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Computing, 18(2):99-109, Nov. 2005.
2. J. P. Anderson. Computer security technology planning study. ESD-TR 73-51, U. S. Air Force Electronic Systems Division, Oct. 1972.
3. P. C. Attie. Wait-free Byzantine consensus. Information Processing Letters, 83(4):221-227, Aug. 2002.
4. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley Series on Parallel and Distributed Computing. Wiley-Interscience, 2nd edition, 2004.
5. D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programing in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287-302, Mar. 1995.
6. A. N. Bessani, M. Correia, J. da Silva Fraga, and L. C. Lung. Towards a dependable tuple space. DI/FCUL TR 06-4, Department of Informatics, University of Lisbon, March 2006.
7. A. N. Bessani, J. da Silva Fraga, and L. C. Lung. BTS: A Byzantine fault-tolerant tuple space. In Proceedings of the 21st ACM Symposium on Applied Computing - SAC 2006, Apr. 2006.
8. C. Cachin and J. A. Poritz. Secure intrusion-tolerant replication on the Internet. In Proceedings of the International Conference on Dependable Systems and Networks - DSN 2002, Washington, DC, USA, June 2002.
9. M. Castro and B. Liskov. Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions Computer Systems, 20(4):398-461, Nov. 2002.
10. M. Correia, N. F. Neves, and P. Veríssimo. How to tolerate half less one Byzantine nodes in practical distributed systems. In Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems, pages 174-183, Oct. 2004.
11. M. Correia, N. F. Neves, and P. Veríssimo. From consensus to atomic broadcast: Time-free byzantine-resistant protocols without signatures. The Computer Journal, 49(1), Jan. 2006.
12. D. Gelernter. Generative communication in Linda. ACM Transactions on Programing Languages and Systems, 7(1):80-112, Jan. 1985.
13. M. Herlihy. Wait-free synchronization. ACM Transactions on Programing Languages and Systems, 13(1):124-149, Jan. 1991.
14. M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programing Languages and Systems, 12(3):463-492, July 1990.
15. R. K. Joshi, N. Vivekananda, and D. J. Ram. Message filters for object-oriented systems. Software - Practice and Experience, 27(6):677-699, June 1997.
16. D. Malkhi, M. Merrit, M. Reiter, and G. Taubenfeld. Objects shared by Byzantine processes. Distributed Computing, 16(1):37-48, Feb. 2003.
17. 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, Apr. 2000.
18. N. H. Minsky, Y. M. Minsky, and V. Ungureanu. Making tuple-spaces safe for heterogeneous distributed systems. In Proceedings of the 15th ACM Symposium on Applied Computing - SAC 2000, pages 218-226, Mar. 2000.
19. N. H. Minsky and V. Ungureanu. Law-governed interaction: a coordination and control mechanism for heterogeneous distributed systems. ACM Transactions on Software Engineering and Methodology, 9(3):273-305, July 2000.
20. S. A. Plotkin. Sticky bits and universality of consensus. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 159-175, June 1989.
21. J. H. Saltzer and M. D. Schroeder. The protection of information in computer systems. In Proceedings of the ACM Symposium on Operating System Principles, Oct. 1973.
22. E. J. Segall. Resilient distributed objects: Basic results and applications to shared spaces. In Proceedings of the 7th Symposium on Parallel and Distributed Processing - SPDP'95, pages 320-327, Oct. 1995.