Implementing sequentially consistent programs on processor consistent platforms

DOI10.1016/J.JPDC.2007.07.002zbMATH Open1243.68319OpenAlexW2086669962MaRDI QIDQ436746FDOQ436746

Jalal Kawash, Lisa Higham

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.07.002

zbMATH Keywords

sequential consistencywait-freedomprogram transformationmemory consistency modelsprocessor consistencyTest\&Set

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Myths about the mutual exclusion problem
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Title not available (Why is that?)
• A new solution of Dijkstra's concurrent programming problem
• Title not available (Why is that?)
• Randomized wait-free concurrent objects (extended abstract)
• Relationships between memory models
• A unified theory of shared memory consistency
• Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
• Computer Aided Verification

Cited In (2)

• Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations
• Languages and Compilers for Parallel Computing

This page was built for publication: Implementing sequentially consistent programs on processor consistent platforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436746)