Reconfigurable distributed storage for dynamic networks |
| |
Authors: | Gregory Chockler Seth Gilbert Vincent Gramoli Peter M Musial Alex A Shvartsman |
| |
Affiliation: | 1. IBM Haifa Labs, Israel;2. EPFL LPD, Switzerland;3. University of Neuchâtel, Switzerland;4. Department of Comp. Sci. and Eng., University of Connecticut, United States;5. MIT CSAIL, United States |
| |
Abstract: | This paper presents a new algorithm 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 the processing nodes, message delays, and message loss. The algorithm incorporates a classic quorum-based algorithm for read/write operations, and an optimized consensus protocol, based on Fast Paxos for reconfiguration, and 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 resulting algorithm tolerates dynamism. We formally prove our algorithm to be correct, we present its performance and compare it to existing reconfigurable memories, and we evaluate experimentally the cost of its reconfiguration mechanism. |
| |
Keywords: | Distributed algorithms Reconfiguration Atomic objects Performance |
本文献已被 ScienceDirect 等数据库收录! |
|