Decoupled Interconnection of Distributed Memory Models

Abstract

Abstract. In this paper we present a framework to formally describe and study the interconnection of distributed shared memory systems. In our models we minimize the dependencies between the original systems and the interconnection system (that is, they are decoupled) and consider systems implemented with invalidation and propagation. We first show that only fast (i.e. wait-free) memory models can be interconnected. We then show that causal and pRAM systems can be interconnected if they fulfill some restrictions, and for these cases, we present protocols to interconnect them. Finally, we present a protocol to interconnect cache systems.

Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users

“…They further defined a formal framework to describe the interconnection of distributed shared memory systems in [9] and showed that only fast memory models can be interconnected, where read and write operations return immediately after only local computations (i.e. no global synchronization, which is required to implement SC systems).…”