The power of multiobjects.
From MaRDI portal
Recommendations
Cites work
- A completeness theorem for a class of synchronization objects
- Atomic snapshots of shared memory
- Composite registers
- Computing with faulty shared objects
- Consensus numbers of multi-objects
- Delimiting the power of bounded size synchronization objects (extended abstract)
- Disentangling multi-object operations (extended abstract)
- Disjoint-access-parallel implementations of strong shared memory primitives
- Impossibility of distributed consensus with one faulty process
- On interprocess communication. II: Algorithms
- On the robustness of Herlihy's hierarchy
- Software transactional memory
- Universal constructions for multi-object operations
- Universal operations
Cited in
(6)- A complexity-based hierarchy for multiprocessor synchronization (extended abstract)
- Unified selection from lists, arrays, and objects.
- Hundreds of impossibility results for distributed computing
- From bounded to unbounded concurrency objects and back
- Distributed Computing
- Randomized protocols for asynchronous consensus
This page was built for publication: The power of multiobjects.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854306)