Linear space bootstrap communication schemes

DOI10.1016/j.tcs.2014.10.013zbMath1303.68033OpenAlexW2030525316MaRDI QIDQ477099

Eli Gafni, Hugues Fauconnier, Sergio Rajsbaum, Carole Delporte-Gallet

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.013

zbMATH Keywords

distributed algorithmsshared memoryspace complexityrenamingread/write registerswait-free computing

Mathematics Subject Classification ID

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

Related Items (3)

Progress-Space Tradeoffs in Single-Writer Memory Implementations ⋮ Linear space bootstrap communication schemes ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects

Cites Work

• Unnamed Item
• Unnamed Item
• The space complexity of unbounded timestamps
• Linear space bootstrap communication schemes
• Help when needed, but no more: efficient read/write partial snapshot
• New combinatorial topology bounds for renaming: the lower bound
• On interprocess communication. II: Algorithms
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Bounds on shared memory for mutual exclusion
• Efficient adaptive collect algorithms
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• Time-space tradeoffs for implementations of snapshots
• The space complexity of long-lived and one-shot timestamp implementations
• On the space complexity of randomized synchronization
• The topological structure of asynchronous computability
• Concurrent Programming: Algorithms, Principles, and Foundations
• Algorithms adapting to point contention
• Renaming in an asynchronous environment
• An optimal multi-writer snapshot algorithm
• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• Time and Space Lower Bounds for Nonblocking Implementations
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• An adaptive collect algorithm with applications
• Space-optimal multi-writer snapshot objects are slow
• Immediate atomic snapshots and fast renaming
• Polylogarithmic concurrent data structures from monotone circuits
• New combinatorial topology bounds for renaming

This page was built for publication: Linear space bootstrap communication schemes