BTS: A Byzantine fault-tolerant tuple space

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2006, Pages 429-433

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

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

^b PONTIFICAL CATHOLIC UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ROBUSTNESS (CONTROL SYSTEMS); SECURITY OF DATA; SECURITY SYSTEMS;

BYZANTINE; FAULT TOLERANT TUPLE SPACE; SECURITY MECHANISMS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33751031085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley Series on Parallel and Distributed Computing. Wiley-Interscience, 2nd edition, 2004.
2. D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287-302, Mar. 1995.
3. N. Busi, R. Gorrieri, R. Lucchi, and G. Zavattaro. SecSpaces: a data-driven coordination model for environments open to untrusted agents. In Electronic Notes in Theoretical Computer Science, volume 68, 2003.
4. N. Busi, R. Gorrieri, and G. Zavattaro. On the expressiveness of Linda coordination primitives. Information and Computation, 156(1/2):90-121, Academic Press, 2000, 156(1-2):90-121, 2000.
5. G. Cabri, L. Leonardi, and F. Zambonelli. Mobile agents coordination models for Internet applications. IEEE Computer, 33(2):82-89, Feb. 2000.
6. M. Castro and B. Liskov. Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions Computer Systems, 20(4):398-461, 2002.
7. M. Castro, R. Rodrigues, and B. Liskov. BASE: Using abstraction to improve fault tolerance. ACM Transactions Computer Systems, 21(3):236-269, 2003.
8. R. De Nicola, G. L. Ferrari, and R. Pugliese. Klaim: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering, 24(5):315-330, 1998.
9. C. Dwork, N. A. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288-322, 1988.
10. J. Fraga and D. Powell. A fault- and intrusion-tolerant file system. In Proceedings of the 3rd Int. Conference on Computer Security, pages 203-218, 1985.
11. D. Gelernter. Generative communication in Linda. ACM Transactions on Programing Languages and Systems, 7(1):80-112, 1985.
12. D. K. Gifford. Weighted voting for replicated data. In Proceedings of the 7th ACM Symposium on Operating Systems Principles, pages 150-162, 1979.
13. M. Herlihy. Wait-free synchronization. ACM Transactions on Programing Languages and Systems, 13(1):124-149, 1991.
14. L. Lamport. The part-time parliament. ACM Transactions Computer Systems, 16(2): 133-169, 1998.
15. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programing Languages and Systems, 4(3):382-401, 1982.
16. D. Malkhi and M. K. Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203-213, 1998.
17. J.-P Martin and L. Alvisi. Fast Byzantine consensus. In Dependable Systems and Networks, DSN 05, 2005.
18. J.-P. Martin, L. Alvisi, and M. Dahlin. Small Byzantine quorum systems. In Dependable Systems and Networks, DSN 01, 2001.
19. N. H. Minsky, Y. M. Minsky, and V. Ungureanu. Making tuple-spaces safe for heterogeneous distributed systems. In Proceedings of the 2000 ACM Symposium on Applied Computing, pages 218-226, 2000.
20. F. B. Schneider. Implementing fault-tolerant service using the state machine aproach: A tutorial. ACM Computing Surveys, 22(4):299-319, 1990.
21. 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, 1995.
22. P. Verssimo, N. F. Neves, and M. P. Correia. Intrusion-tolerant architectures: Concepts and design. In R. Lemos, C. Gacek, and A. Romanovsky, editors, Architecting Dependable Systems, volume 2677 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
23. J. Vitek, C. Bryce, and M. Oriol. Coordination processes with Secure Spaces. Science of Computer Programming, 46(1-2):163-193, 2003.
24. A. Xu and B. Liskov. A design for a fault-tolerant, distributed implementation of Linda. In Proceedings of the 19th Symposium on Fault-Tolerant Computing - FTCS'89, pages 199-206, 1989.