Metraipolis › archive › dc_4fbb39cae305

A Deterministic Commitment Rule over Unstructured DAGs for Optimistic Replication — arXiv:2610.41837

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41837
License (as archived)
CC0-1.0
Archived
2026-11-02T07:44:56.581Z
SHA-256 of the archived text
7d9d5c1e07df8ab83048338776247693452f193e546eeda22423499de88f247e
Stable URL of this page
https://metraipolis.com/documento/dc_4fbb39cae305

How to cite

A Deterministic Commitment Rule over Unstructured DAGs for Optimistic Replication — arXiv:2610.41837 — arXiv (en), https://arxiv.org/abs/2610.41837 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4fbb39cae305 (Metraipolis archive dc_4fbb39cae305, sha256 7d9d5c1e07df8ab83048338776247693452f193e546eeda22423499de88f247e)
BibTeX
@misc{dc4fbb39cae305,
  title = {A Deterministic Commitment Rule over Unstructured DAGs for Optimistic Replication — arXiv:2610.41837},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41837},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4fbb39cae305; sha256 7d9d5c1e07df8ab83048338776247693452f193e546eeda22423499de88f247e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41837. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In optimistic replication protocols, each replica uses the local state to execute requests from its clients in a wait-free manner, without synchronizing with other replicas. The outcomes may be revised later, making optimistic protocols only eventually consistent. To compensate for this consistency loss, an additional commitment mechanism can be employed: an underlying atomic broadcast protocol that allows replicas to periodically agree on the evolution of the object state. In this paper, we introduce a simple framework for optimistic replication based on a causality DAG: every replica represents the object state via a causally ordered set of client operations. The framework incorporates a deterministic commitment rule that incurs virtually zero message overhead beyond the basic dissemination of submitted operations.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2610.41837 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:37:30.166Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).