Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/90003
Título: | An oblivious observed-reset embeddable replicated counter |
Autor(es): | Weidner, Matthew Almeida, Paulo Sérgio |
Palavras-chave: | CRDTs distributed counting eventual consistency |
Data: | 2022 |
Editora: | Association for Computing Machinery |
Citação: | Matthew Weidner and Paulo Sérgio Almeida. 2022. An oblivious observed-reset embeddable replicated counter. In Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC '22). Association for Computing Machinery, New York, NY, USA, 47–52. https://doi.org/10.1145/3517209.3524084 |
Resumo(s): | Embedding CRDT counters has shown to be a challenging topic, since their introduction in Riak Maps. The desire for obliviousness, where all information about a counter is fully removed upon key removal, faces problems due to the possibility of concurrency between increments and key removals. Previous state-based proposals exhibit undesirable reset-wins semantics, which lead to losing increments, unsatisfactorily solved through manual generation management in the API. Previous operation-based approaches depend on causal stability, being prone to unbounded counter growth under network partitions. We introduce a novel embeddable operation-based CRDT counter which achieves both desirable observed-reset semantics and obliviousness upon resets. Moreover, it achieves this while merely requiring FIFO delivery, allowing a tradeoff between causal consistency and faster information propagation, being more robust under network partitions. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/90003 |
ISBN: | 978-1-4503-9256-3 |
DOI: | 10.1145/3517209.3524084 |
Versão da editora: | https://dl.acm.org/doi/10.1145/3517209.3524084 |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: |