Cooperative asynchronous update of shared memory

DOI10.1145/1060590.1060698MaRDI QIDQ3581460zbMATH OpenOpenAlexFDO

Authors Bogdan S. Chlebus, Dariusz R. Kowalski

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060698

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 177544
• Dynamic Task Allocation in Asynchronous Shared Memory
• An asynchronous protocol for release consistent distributed shared memory systems
• Asynchronous shared memory search structures
• The Synchronization Power of Coalesced Memory Accesses
• Efficient synchronization of multiprocessors with shared memory
• At-Most-Once Semantics in Asynchronous Shared Memory
• A Model for Asynchronous Shared Memory Parallel Computation
• scientific article; zbMATH DE number 1305392

Cited in

(10)

• An asynchronous protocol for release consistent distributed shared memory systems
• Solving the at-most-once problem with nearly optimal effectiveness
• scientific article; zbMATH DE number 1305392 (Why is no real title available?)
• Algorithms for the Certified Write-All Problem
• The strong at-most-once problem
• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
• An algorithm for the asynchronous \textit{Write-All} problem based on process collision
• Algorithms and Computation
• Doing-it-all with bounded work and communication
• Dynamic Task Allocation in Asynchronous Shared Memory

This page was built for publication: Cooperative asynchronous update of shared memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581460)