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. Copyright © 2011 ACM.
k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses / Baldoni, Roberto; Bonomi, Silvia; Michel, Raynal. - (2011), pp. 99-104. (Intervento presentato al convegno 13th European Workshop on Dependable Computing, EWDC 2011 tenutosi a Pisa, Italy nel 11 May 2011 through 12 May 2011) [10.1145/1978582.1978603].
k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses
BALDONI, Roberto;BONOMI, Silvia;
2011
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. Copyright © 2011 ACM.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2011_11573-415892.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
206.51 kB
Formato
Adobe PDF
|
206.51 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
