Interconnection of distributed memory models

Authors:
Vicent Cholvi;Ernesto Jiménez;Antonio Fernández Anta
Affiliations:
Universitat Jaume I, 12071 Castellón, Spain;Universidad Politécnica de Madrid, 28031 Madrid, Spain;LADyR, GSyC, Universidad Rey Juan Carlos, 28933 Móstoles, Spain
Venue:
Journal of Parallel and Distributed Computing
Year:
2009

Citing 14
Cited 0

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
The power of processor consistency

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Sequential consistency versus linearizability

ACM Transactions on Computer Systems (TOCS)
Limitations of fast consistency conditions for distributed shared memories

Information Processing Letters
Scope consistency: a bridge between release consistency and entry consistency

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Memory consistency and event ordering in scalable shared-memory multiprocessors

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
An Adaptive Protocol for Implementing Causally Consistent Distributed Services

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Relationships between memory models

Information Processing Letters
On the interconnection of causal memory systems

Journal of Parallel and Distributed Computing
A unified theory of shared memory consistency

Journal of the ACM (JACM)
Specifying memory consistency of write buffer multiprocessors

ACM Transactions on Computer Systems (TOCS)
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers
On specification of Read/Write shared variables

Journal of the ACM (JACM)
A parametrized algorithm that implements sequential, causal, and cache memory consistencies

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a framework to formally describe and study the interconnection of distributed shared memory systems. Using it allows us to classify the consistency models in two groups, depending on whether they are fast or not. In the case of non-fast consistency models, we show that they cannot be interconnected in any way. In contrast, in the case of fast consistency models we provide protocols to interconnect some of them.