Roberto Baldoni
ABSTRACT
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.
- Aguilera M. K., Keidar I., Malkhi D., Shraer A. Dynamic atomic storage without consensus in proceedings of 28<sup>th</sup> Annual ACM Symposium on Principles of Distributed Computing 2009, 17--25 Google Scholar
Digital Library
- Baldoni R., Bonomi S., Kermarrec A. M., Raynal M., Implementing a Register in a Dynamic Distributed System. in Proc. 29th IEEE Int'l Conference on Distributed Computing Systems, IEEE Press, pp. 639--647, 2009. Google ScholarDigital Library
- Baldoni R., Bonomi S., Raynal M., Value-based Sequential Consistency for Set Objects in Dynamic Distributed Systems Proceedings of Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference. Google ScholarDigital Library
- Baldoni R., Bonomi S., Raynal M., Set Objects in Eventually Synchronous Distributed Systems with Churn and Continuous Accesses MIDLAB Tec. Report 1/2010 http://www.dis.uniromal.it/~ midlab/articoliGoogle Scholar
- Cavin D., Sasson Y., Shiper A. Consensus with Unknown Participants or Fundamental Self-Organization In Proceedings of the 3rd International Conference on AD-HOC Networks & Wireless (ADHOC-NOW) 2004.Google Scholar
- Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. JACM, 43(2):225--267, 1996. Google ScholarDigital Library
- Delporte-Gallet C., Fauconnier H. Two Consensus Algorithms with Atomic Registers and Failure Detector Ω. 10th Int'l Conf. on Distr. Commuting and Networking Springer-Verlag, LNCS 5408, pp 251--262, 2009. Google ScholarDigital Library
- Dwork C., Lynch N. and Stockmeyer L., Consensus in the Presence of Partial Synchrony. JACM, 35(2):288--323, 1988. Google ScholarDigital Library
- Friedman R., Raynal M. and Travers C., Abstractions for Implementing Atomic Objects in Distributed Systems. 9th Int'l Conference on Principles of Distributed Systems, LNCS #3974, pp. 73--87, 2005. Google ScholarDigital Library
- Greve, F. and Tixeuil, S. Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks Proceeding of 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN):, pp. 82--91 Google ScholarDigital Library
- Ko S., Hoque I. and Gupta I., Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols. Proc. 27th IEEE Int'l Symposium on Reliable Distributed Systems, 2008. Google ScholarDigital Library
- Lynch, N. and Shvartsman A., RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. Proc. 16th Int'l Symposium on Distributed Computing, Springer-Verlag LNCS #2508, pp. 173--190, 2002. Google ScholarDigital Library
- Tucci Piergiovanni S. and Baldoni R. Connectivity in Eventually Quiescent Dynamic Distributed Systems Third Latin-American Symposium on Dependable Computing, LNCS, 38--56, 2007. Google ScholarDigital Library
Index Terms
- k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses
Recommendations
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 IThis paper introduces a shared object, namely a set object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition suited to such an object is introduced. This condition, named value-based ...
Implementing set objects in dynamic distributed systems
This paper considers a set object, i.e., a shared object allowing users (processes) to add and remove elements to the set, as well as taking consistent snapshots of its content. Specifically, we show that there not exists any protocol implementing a set ...
Implementing a Register in a Dynamic Distributed System
ICDCS '09: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing SystemsProviding distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one of the most basic ones. Several protocols have been proposed that build an ...
Comments