000128581 001__ 128581
000128581 005__ 20181203021314.0
000128581 0247_ $$2doi$$a10.1016/j.jpdc.2008.07.007
000128581 02470 $$2ISI$$a000261775800010
000128581 037__ $$aARTICLE
000128581 245__ $$aReconfigurable Distributed Storage for Dynamic Networks
000128581 269__ $$a2008
000128581 260__ $$c2008
000128581 336__ $$aJournal Articles
000128581 520__ $$aThis 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.
000128581 6531_ $$aDistributed algorithms
000128581 6531_ $$aReconfiguration
000128581 6531_ $$aAtomic objects
000128581 6531_ $$aPerformance
000128581 700__ $$aChockler, Gregory
000128581 700__ $$0240435$$g176464$$aGilbert, Seth
000128581 700__ $$0242987$$g183046$$aGramoli, Vincent
000128581 700__ $$aMusial, Peter M.
000128581 700__ $$aShvartsman, Alexander A.
000128581 773__ $$tJournal of Parallel and Distributed Computing
000128581 909C0 $$xU10407$$0252114$$pDCL
000128581 909CO $$pIC$$particle$$ooai:infoscience.tind.io:128581
000128581 937__ $$aLPD-ARTICLE-2008-015
000128581 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000128581 980__ $$aARTICLE