Document Open Access Logo

Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage

Authors Eduardo Alchieri, Alysson Bessani, Fabíola Greve, Joni da Silva Fraga

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2017.26.pdf
  • Filesize: 0.78 MB
  • 17 pages

Document Identifiers

Author Details

Eduardo Alchieri
Alysson Bessani
Fabíola Greve
Joni da Silva Fraga

Cite AsGet BibTex

Eduardo Alchieri, Alysson Bessani, Fabíola Greve, and Joni da Silva Fraga. Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 95, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.OPODIS.2017.26

Abstract

Quorum systems are useful tools for implementing consistent and available storage in the presence of failures. These systems usually comprise of a static set of servers that provide a fault-tolerant read/write register accessed by a set of clients. We consider a dynamic variant of these systems and propose FreeStore, a set of fault-tolerant protocols that emulates a register in dynamic asynchronous systems in which processes are able to join/leave the set of servers during the execution. These protocols use a new abstraction called view generators, that captures the agreement requirements of reconfiguration and can be implemented in different system models with different properties. Particularly interesting, we present a reconfiguration protocol that is modular, efficient, consensus-free and loosely coupled with read/write protocols. An analysis and an experimental evaluation show that the proposed protocols improve the overall system performance when compared with previous solutions.
Keywords
  • Distributed Systems
  • Reconfiguration
  • Fault-Tolerant Quorum Systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Marcos K. Aguilera, Idit Keidar, Dahlia Malkhi, Jean-Philippe Martin, and Alexander Shraer. Reconfiguring replicated atomic storage: A tutorial. Bulletin of EATCS: The Distributed Computing Column, 2010. Google Scholar
  2. Marcos K. Aguilera, Idit Keidar, Dahlia Malkhi, and Alexander Shraer. Dynamic atomic storage without consensus. Journal of the ACM, 58:7:1-7:32, 2011. Google Scholar
  3. Eduardo Alchieri, Alysson Bessani, Fabiola Greve, and Joni Fraga. Efficient and modular consensus-free reconfiguration for fault-tolerant storage. ArXiv, 2016. URL: http://arxiv.org/abs/1607.05344.
  4. Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, 1995. Google Scholar
  5. Kenneth Birman and Thomas Joseph. Exploiting virtual synchrony in distributed systems. In Proc. of the 11th ACM Symp. on Operating Systems Principles (SOSP'87), 1987. Google Scholar
  6. C. Cachin, R. Guerraoui, and L. Rodrigues. Introduction to Reliable and Secure Distributed Programming (2nd Edition). Springer-Verlag, 2011. Google Scholar
  7. Tushar Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, 1996. Google Scholar
  8. Partha Dutta, Rachid Guerraoui, Ron R. Levy, and Marko Vukolić. Fast access to distributed atomic memory. SIAM Journal on Computing, 39(8):3752-3783, 2010. Google Scholar
  9. Cyntia Dwork, Nancy A. Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288-322, 1988. Google Scholar
  10. Rui Fan and Nancy Lynch. Efficient replication of large data objects. In Proc. of the 17th Int. Symp. on Distributed Computing (DISC'03), 2003. Google Scholar
  11. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985. Google Scholar
  12. Eli Gafni and Dahlia Malkhi. Elastic configuration maintenance via a parsimonious speculating snapshot solution. In Proc. of the 29th Int. Symp. on Distributed Computing (DISC'15), 2015. Google Scholar
  13. David Gifford. Weighted voting for replicated data. In Proc. of the 7th ACM Symp. on Operating Systems Principles (SOSP'79), 1979. Google Scholar
  14. Seth Gilbert, Nancy Lynch, and Alex Shvartsman. Rambo: A robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing, 23(4), 2010. Google Scholar
  15. Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programing Languages and Systems, 13(1), 1991. Google Scholar
  16. Leander Jehl and Hein Meling. The case for reconfiguration without consensus. In Proc. of the 20th Int. Conf. on Principles of Distributed Systems (OPODIS'16), 2016. Google Scholar
  17. Leander Jehl, Roman Vitenberg, and Hein Meling. Smartmerge: A new approach to reconfiguration for atomic storage. In Proc. of the 29th Int. Symp. on Distributed Computing (DISC'15), 2015. Google Scholar
  18. Leslie Lamport. On interprocess communication (part II). Distributed Computing, 1(1):203-213, 1986. Google Scholar
  19. Leslie Lamport. The part-time parliament. ACM Transactions Computer Systems, 16(2):133-169, 1998. Google Scholar
  20. Jean-Philippe Martin and Lorenzo Alvisi. A framework for dynamic Byzantine storage. In Proc. of the 34th Int. Conf. on Dependable Systems and Networks (DSN'04), 2004. Google Scholar
  21. Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. Dynamic Reconfiguration: A Tutorial. In Proc. of the 19th Int. Conf. on Principles of Distributed Systems (OPODIS'15), 2015. Google Scholar
  22. Brian White et. al. An integrated experimental environment for distributed systems and networks. In Proc. of the 5th Symp. on Operating Systems Design and Implementations (OSDI'02), 2002. Google Scholar
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact