Alysson Neves Bessani
ABSTRACT
Generative coordination is one of the most prominent coordination models for implementing open systems due to its spatial and temporal decoupling. Recently, a coordination community effort have been trying to integrate security mechanisms to this model aiming to improve its robustness. In this context, this paper presents the BTS coordination model, which provides a Byzantine fault-tolerant tuple space. Byzantine faults are commonly used to represent both process crashes and intrusions. As far as we know. BTS is the first coordination model that supports this dependability level.
- H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley Series on Parallel and Distributed Computing. Wiley-Interscience, 2nd edition, 2004. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- G. Cabri, L. Leonardi, and F. Zambonelli. Mobile agents coordination models for Internet applications. IEEE Computer, 33(2):82--89, Feb. 2000. Google ScholarDigital Library
- M. Castro and B. Liskov. Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions Computer Systems, 20(4):398--461, 2002. Google ScholarDigital Library
- M. Castro, R. Rodrigues, and B. Liskov. BASE: Using abstraction to improve fault tolerance. ACM Transactions Computer Systems, 21(3):236--269, 2003. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- C. Dwork, N. A. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288--322, 1988. Google ScholarDigital Library
- 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.Google Scholar
- D. Gelernter. Generative communication in Linda. ACM Transactions on Programing Languages and Systems, 7(1):80--112, 1985. Google ScholarDigital Library
- D. K. Gifford. Weighted voting for replicated data. In Proceedings of the 7th ACM Symposium on Operating Systems Principles, pages 150--162, 1979. Google ScholarDigital Library
- M. Herlihy. Wait-free synchronization. ACM Transactions on Programing Languages and Systems, 13(1):124--149, 1991. Google ScholarDigital Library
- L. Lamport. The part-time parliament. ACM Transactions Computer Systems, 16(2): 133--169, 1998. Google ScholarDigital Library
- L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programing Languages and Systems, 4(3):382--401, 1982. Google ScholarDigital Library
- D. Malkhi and M. K. Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203--213, 1998. Google ScholarDigital Library
- J.-P. Martin and L. Alvisi. Fast Byzantine consensus. In Dependable Systems and Networks, DSN 05, 2005. Google ScholarDigital Library
- J.-P. Martin, L. Alvisi, and M. Dahlin. Small Byzantine quorum systems. In Dependable Systems and Networks, DSN 01, 2001. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- F. B. Schneider. Implementing fault-tolerant service using the state machine aproach: A tutorial. ACM Computing Surveys, 22(4):299--319, 1990. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Vitek, C. Bryce, and M. Oriol. Coordination processes with Secure Spaces. Science of Computer Programming, 46(1-2):163--193, 2003. Google ScholarDigital Library
- 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.Google ScholarCross Ref
Index Terms
- BTS: a Byzantine fault-tolerant tuple space
Recommendations
Sampling + DMR: practical and low-overhead permanent fault detection
ISCA '11With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting and isolating faulty cores, but the required fault detection coverage becomes ...
Reliability Analysis of N-Modular Redundancy Systems with Intermittent and Permanent Faults
It is well known that static redundancy techniques are very efficient against intermittent (transient) faults which constitute a large portion of logic faults in digital systems. However, very little theoretical work has been done in evaluating the ...
Relyzer: exploiting application-level fault equivalence to analyze application resiliency to transient faults
ASPLOS XVII: Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating SystemsFuture microprocessors need low-cost solutions for reliable operation in the presence of failure-prone devices. A promising approach is to detect hardware faults by deploying low-cost monitors of software-level symptoms of such faults. Recently, ...
Comments