The SMART way to migrate replicated stateful services
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Antiquity: exploiting a secure log for wide-area distributed storage
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Data-centric reconfiguration with network-attached disks
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Dynamic atomic storage without consensus
Journal of the ACM (JACM)
Online migration for geo-distributed storage systems
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Surviving congestion in geo-distributed storage systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Brief announcement: decoupled and consensus-free reconfiguration for fault-tolerant storage
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We present a framework for transforming severalquorum-based protocols so that they can dynamicallyadapt their failure threshold and server count, allowingthem to be reconfigured in anticipation of possiblefailures or to replace servers as desired. We demonstratethis transformation on the dissemination quorumprotocol. The resulting system provides confirmablewait-free atomic semantics while tolerating Byzantinefailures from the clients or servers. The system cangrow without bound to tolerate as many failures as desired.Finally, the protocol is optimal and fast: only theminimal number of servers - 3f + 1- is needed to tolerateany f failures and, in the common case, reads requireonly one message round-trip.