The power of multiobjects.

DOI10.1006/inco.1999.2793zbMath1045.68501OpenAlexW2034332299MaRDI QIDQ1854306

Yehuda Afek, Michael Merritt, Gadi Taubenfeld

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2793

zbMATH Keywords

shared memory systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Related Items (2)

Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus

Cites Work

• On interprocess communication. II: Algorithms
• Composite registers
• Consensus numbers of multi-objects
• Universal operations
• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• Computing with faulty shared objects
• On the robustness of Herlihy's hierarchy
• A completeness theorem for a class of synchronization objects
• Delimiting the power of bounded size synchronization objects (extended abstract)
• Disjoint-access-parallel implementations of strong shared memory primitives
• Universal constructions for multi-object operations
• Software transactional memory
• Disentangling multi-object operations (extended abstract)

This page was built for publication: The power of multiobjects.