Efficient algorithms for checking the atomicity of a run of read and write operations

DOI10.1007/BF01177745zbMath0824.68045OpenAlexW4237892343MaRDI QIDQ1892712

Andreas G. Veneris, Lefteris M. Kirousis

Publication date: 21 June 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01177745

zbMATH Keywords

time-complexity function

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Concurrent reading while writing revisited
• On interprocess communication. I: Basic formalism
• A criterion for atomicity
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Bounded time-stamps
• Composite registers
• Time and space optimal implementations of atomic multi-writer register
• Time, clocks, and the ordering of events in a distributed system
• Atomic snapshots of shared memory
• The elusive atomic register
• Randomized wait-free concurrent objects (extended abstract)
• Unnamed Item

This page was built for publication: Efficient algorithms for checking the atomicity of a run of read and write operations