Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Algorithms
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Dynamic Quorums for DHT-based P2P Networks
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
P2P Architecture for Self-Atomic Memory
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Multi-dimensional quorum sets for read-few write-many replica control protocols
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Internet-scale applications require more and more resources to satisfy the unpredictable clients needs. Specifically, such applications must ensure quality of service despite bursts of load. Distributed dynamic self-organized systems present an inherent adaptiveness that can face unpredictable bursts of load. Nevertheless quality of service, and more particularly data consistency, remains hardly achievable in such systems since participants (i.e., nodes) can crash, leave, and join the system at arbitrary time. Atomic consistency guarantees that any read operation returns the last written value of a data and is generalizable to data composition. To guarantee atomic consistency in message-passing model, mutually intersecting sets (a.k.a. quorums) of nodes are used. The solution presented here, namely Square, uses self-adaptiveness and load-balancing to provide atomic consistency in large-scale dynamic distributed systems. This paper presents the Square algorithm and uses extensive simulation to show it achieves its desirable properties.