A Correctness Condition for High-Performance Multiprocessors

DOI10.1137/S0097539795289215zbMath0907.68005MaRDI QIDQ4210126

Hagit Attiya, Roy Friedman

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

weak consistencydistributed shared memoryconsistency conditionssequential consistencyhybrid consistency

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical problems of computer architecture (68M07) Data structures (68P05) Distributed algorithms (68W15)

Related Items (7)

Limitations of fast consistency conditions for distributed shared memories ⋮ Randomized registers and iterative algorithms ⋮ Implementing hybrid consistency with high-level synchronization operations ⋮ Hundreds of impossibility results for distributed computing ⋮ Algebraic topology and concurrency ⋮ Relaxed data types as consistency conditions ⋮ On the composability of consistency conditions

This page was built for publication: A Correctness Condition for High-Performance Multiprocessors