Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols
SRDS '08 Proceedings of the 2008 Symposium on Reliable Distributed Systems
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Implementing a Register in a Dynamic Distributed System
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Value-based sequential consistency for set objects in dynamic distributed systems
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Connectivity in eventually quiescent dynamic distributed systems
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
| Hi-index | 0.00 |
This paper introduces a "k-bounded set object", namely a shared object with limited memory that allows processes to add and remove values as well as take a snapshot of its content. The interest of the k-bounded set lies in the fact that it can be used to program useful abstractions for dynamic distributed systems, such as an eventual participant detector.