Revisionist Simulations: A New Approach to Proving Space Lower Bounds
PODC '18: ACM Symposium on Principles of Distributed Computing Egham United Kingdom July, 2018, pp. 61-70, 2018.
Determining the number of registers required for solving x-obstruction-free (or randomized wait-free) k-set agreement for x ≤ k is an open problem that highlights important gaps in our understanding of the space complexity of synchronization. In x-obstruction-free protocols, processes are required to return in executions where at most x p...More
Full Text (Upload PDF)
PPT (Upload PPT)