arXiv (All)
open access
Efficient Randomized LL/SC that Preserves History Independence
We study the fundamental problem of implementing $m$ linearizable LL/SC objects with constant expected step complexity in a system of $n$ processes, using bounded base objects commonly available in hardware. Assuming that each process may have at most $τ$ outstanding LL() operations, the best known
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
- Algorithmic Randomness, Exchangeability, and the Principal Principle#89744
- Algorithmic Randomness, Exchangeability, and the Principal Principle#694494
- On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes#2552
- Benchmarking LLMs on File System Design and Implementation#429459
- Logarithmic-Free Moment and Generalization Bounds for Uniformly Stable Algorithms#441785
Record · ID 1012305
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