Chockler, Gregory, Gilbert, Seth, Gramoli, Vincent, Musial, Peter and Shvartsman, Alex (2009) Reconfigurable Distributed Storage for Dynamic Networks. Journal of Parallel and Distributed Computing, 69 (1).
Full text access: Open
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.
This is a Submitted version This version's date is: 1/2009 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/904d5200-1f1b-88a0-8921-35b47e9d3e27/2/
Deposited by Research Information System (atira) on 30-Oct-2012 in Royal Holloway Research Online.Last modified on 30-Oct-2012