2 papers
cs.DC2025
Why Canonical Rounds Fail for Optimal Byzantine Resilience
Hagit Attiya, Itay Flam, Jennifer L. Welch
Canonical asynchronous rounds are a widely used abstraction for structuring distributed algorithms, making asynchronous executions appear synchronous and enabling modular reasoning…
cs.DC2024
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
Colette Johnen, Adnane Khattabi, Alessia Milani +1
Relaxing the sequential specification of a shared object is a way to obtain an implementation with better performance compared to implementing the original specification. We apply…