TY - GEN
T1 - Reconfigurable distributed storage for dynamic networks
AU - Chockler, Gregory
AU - Gilbert, Seth
AU - Gramoli, Vincent
AU - Musial, Peter M.
AU - Shvartsman, Alex A.
N1 - Funding Information:
Alexander Shvartsman is a Professor of Computer Science and Engineering at the University of Connecticut. He received his Ph.D. in Computer Science from Brown University in 1992. Prior to embarking on the academic career, he worked for over 10 years at AT&T Bell Labs and Digital Equipment Corporation. His research in distributed computing has been funded by several NSF grants, including the NSF Career Award. Shvartsman is an author of over 100 papers, two books, and several book chapters. He chaired and he served on many program committees of the top conferences in distributed computing, and he is a Vigneron d’Honneur of Jurade de Saint-Emilion.
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Atomic objects
KW - Distributed algorithms
KW - Performance
KW - Reconfiguration
UR - http://www.scopus.com/inward/record.url?scp=38449101314&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38449101314&partnerID=8YFLogxK
U2 - 10.1007/11795490_27
DO - 10.1007/11795490_27
M3 - Conference contribution
AN - SCOPUS:38449101314
SN - 3540363211
SN - 9783540363217
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 351
EP - 365
BT - Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers
T2 - 9th International Conference on Principles of Distributed Systems, OPODIS 2005
Y2 - 12 December 2005 through 14 December 2005
ER -