Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about parallel architectures
Reasoning about parallel architectures
Lazy release consistency for software distributed shared memory
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
On the interconnection of causal memory systems
Journal of Parallel and Distributed Computing
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
Journal of Systems and Software
Implementing sequentially consistent programs on processor consistent platforms
Journal of Parallel and Distributed Computing
Interconnection of distributed memory models
Journal of Parallel and Distributed Computing
Revising 1-Copy Equivalence in Replicated Databases with Snapshot Isolation
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
| Hi-index | 0.89 |
There have been many proposals of shared memory systems, each one providing different types of memory coherence for interprocess communication. However, they have usually been defined using different formalisms. This makes it difficult to compare among them the different proposals put forward. In this paper we present a formal framework for specifying memory models with different coherency properties. We specify most of the known shared memory models using our framework, showing some of the relationships that hold among them.