Interconnection of distributed memory models

Abstract

a b s t r a c tIn 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.

Yet Another Simple Solution for the Concurrent Programming Control Problem

“…Comprehensive reviews of shared memory consistency models can be found in [26], [10], [7]. Among the consistency models, sequential consistency is most simple and intuitive model that naturally extends the memory behavior of uniprocessor system to multiprocessors systems.…”