Progress-Space Tradeoffs in Single-Writer Memory Implementations

DOI10.4230/LIPIcs.OPODIS.2017.9zbMath1487.68045arXiv1709.01879OpenAlexW2963311280MaRDI QIDQ3300806

Damien Imbs, Thibault Rieutord, Petr Kuznetsov

Publication date: 30 July 2020

Full work available at URL: https://arxiv.org/abs/1709.01879

zbMATH Keywords

space complexityprogress conditionscomparison-based algorithmssingle-writer memory implementation

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Linear space bootstrap communication schemes
• Bounds on shared memory for mutual exclusion
• Safety-Liveness Exclusion in Distributed Computing
• On the Space Complexity of Set Agreement
• Time-space tradeoffs for implementations of snapshots
• Time and space lower bounds for non-blocking implementations (preliminary version)
• Renaming in an asynchronous environment
• Contention-Sensitive Data Structures and Algorithms
• Atomic snapshots of shared memory
• A tight space bound for consensus
• Wait-free solvability of colorless tasks in anonymous shared-memory model

This page was built for publication: Progress-Space Tradeoffs in Single-Writer Memory Implementations