Axioms for memory access in asynchronous hardware systems

DOI10.1145/5001.5007zbMath0593.68017OpenAlexW2070356883WikidataQ114613786 ScholiaQ114613786MaRDI QIDQ3723682

No author found.

Publication date: 1986

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1986-8/

zbMATH Keywords

VLSIasynchronous algorithmsconcurrent accesseslow-level hardware components

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (18)

On interprocess communication. II: Algorithms ⋮ Composite registers ⋮ Schedulers and Finishers: On Generating the Behaviours of an Event Structure ⋮ Concurrent Kleene Algebra ⋮ Relationships between memory models ⋮ Analyzing linearizability violations in the presence of read-modify-write operations ⋮ Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems ⋮ The behavior of shared objects: Concept, pitfalls, and a new model ⋮ A Simple Object that Spans the Whole Consensus Hierarchy ⋮ Data-race and concurrent-write freedom are undecidable. ⋮ Introduction à l'algorithmique des objets partagés ⋮ Causal memory: definitions, implementation, and programming ⋮ Computing $k$-Atomicity in Polynomial Time ⋮ A criterion for atomicity ⋮ Time and space optimal implementations of atomic multi-writer register ⋮ Schedulers and finishers: on generating and filtering the behaviours of an event structure ⋮ Proof of correctness of Ressel's adopted algorithm ⋮ Linearizable read/write objects

This page was built for publication: Axioms for memory access in asynchronous hardware systems