Metraipolis › archive › dc_2eba89197aad

On Latency-Optimal Implementations of the Timestamp Object — arXiv:2610.32844

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.32844
License (as archived)
CC0-1.0
Archived
2026-10-26T19:54:39.437Z
SHA-256 of the archived text
2fcfebca17a687c5127256100029bd1db8982790b069ed3290d7085ab609c403
Stable URL of this page
https://metraipolis.com/documento/dc_2eba89197aad

How to cite

On Latency-Optimal Implementations of the Timestamp Object — arXiv:2610.32844 — arXiv (en), https://arxiv.org/abs/2610.32844 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2eba89197aad (Metraipolis archive dc_2eba89197aad, sha256 2fcfebca17a687c5127256100029bd1db8982790b069ed3290d7085ab609c403)
BibTeX
@misc{dc2eba89197aad,
  title = {On Latency-Optimal Implementations of the Timestamp Object — arXiv:2610.32844},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.32844},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2eba89197aad; sha256 2fcfebca17a687c5127256100029bd1db8982790b069ed3290d7085ab609c403},
  year = {2026}
}

Archived text

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

Timestamps are widely used in distributed algorithms to order operations. In this paper, we study the timestamp object (TS), which provides a single operation that returns strictly increasing integers. We ask two questions: What is the maximum resilience and the minimum latency of TS implementations in asynchronous message-passing systems, where latency is measured by worst-case message delay? We answer these questions under various types of failure: crash failures, and Byzantine failures with and without digital signatures. To do so, we give lower bounds and algorithms that determine (1) the optimal resilience of TS implementations under each type of failure, and (2) the optimal latency in all cases but one. Along the way, we introduce a new lower-bound proof technique called a cyclic chain argument, which constructs a cycle of indistinguishable schedules along which the returned timestamps must strictly increase, yielding a contradiction.

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.32844 — 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-10-26T19:46:03.298Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).