Interconnection of distributed memory models

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. © 2008 Elsevier Inc. All rights reserved.

Año de publicación:

2009

Keywords:

• Interconnection systems
• distributed shared memory
• Memory models
• distributed algorithms
• Correctness proofs
• Impossibility result

Fuente:

scopus