arXiv (All)
open access
On Latency-Optimal Implementations of the Timestamp Object
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Latency-Optimal Implementations of the Timestamp Object#1442321
- Dynamically Quantifying and Improving the Reliability of Distributed Storage Systems#16757
- Real-Time Decentralized Information Processing and Returns to Scale#486191
- Collision Detection is Instance $\widetilde{O}$ptimal Under the Birthday Threshold#1141665
- Collision Detection is Instance $\widetilde{O}$ptimal Under the Birthday Threshold#1122198
Record · ID 1448360
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive