Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical problems of computer architecture (68M07) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Recommendations
- From causal consistency to sequential consistency in shared memory systems
- A unified theory of shared memory consistency
- scientific article; zbMATH DE number 2102714
- Multi-writer consistency conditions for shared memory objects
- A Deadlock-Free Semantics for Shared Memory Concurrency
- Deterministic concurrency: a clock-synchronised shared memory approach
- scientific article; zbMATH DE number 3890713
- Semantics of Deterministic Shared-Memory Systems
- Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
Cited in
(9)- Scope consistency: A bridge between release consistency and entry consistency
- Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
- Linearizable read/write objects
- Randomized registers and iterative algorithms
- From causal consistency to sequential consistency in shared memory systems
- An operational model for multiprocessors with caches
- A Correctness Condition for High-Performance Multiprocessors
- Implementing sequentially consistent programs on processor consistent platforms
- Programmer-centric memory consistency modelling
This page was built for publication: Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388863)
