Reconfigurable distributed storage for dynamic networks

  • Authors:

  • Gregory Chockler;Seth Gilbert;Vincent Gramoli;Peter M. Musial;Alex A. Shvartsman

  • Affiliations:

  • CSAIL, Massachusetts Institute of Technology, Cambridge, MA;CSAIL, Massachusetts Institute of Technology, Cambridge, MA;Dep. of Comp. Sci. and Eng., University of Connecticut, Storrs, CT;Dep. of Comp. Sci. and Eng., University of Connecticut, Storrs, CT;CSAIL, Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new algorithm, RDS (Reconfigurable Distributed Storage), for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures of processors and message loss and delays. The algorithm incorporates a quorum-based read/write algorithm and an optimized consensus protocol, based on Paxos. RDS achieves the design goals of: (i) allowing read and write operations to complete rapidly, and (ii) providing long-term fault tolerance through reconfiguration, a process that evolves the quorum configurations used by the read and write operations. The new algorithm improves on previously developed alternatives by using a more efficient reconfiguration protocol, thus guaranteeing better fault tolerance and faster recovery from network instability. This paper presents RDS, a formal proof of correctness, conditional performance analysis, and experimental results.