Constructing two-writer atomic registers

DOI10.1109/12.9729zbMath0663.68034OpenAlexW2126944540MaRDI QIDQ3814792

Bard Bloom

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.9729

zbMATH Keywords

shared memoryatomicityregistersasynchronous processorsreaders-writers problem

Mathematics Subject Classification ID

Related Items (10)

Composite registers ⋮ Highly concurrent logically synchronous multicast ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ The behavior of shared objects: Concept, pitfalls, and a new model ⋮ A criterion for atomicity revisited ⋮ Introduction à l'algorithmique des objets partagés ⋮ On interprocess communication and the implementation of multi-writer atomic registers ⋮ Efficient parallel algorithms can be made robust ⋮ A criterion for atomicity ⋮ Optimality of wait-free atomic multiwriter variables

This page was built for publication: Constructing two-writer atomic registers