Interconnection of distributed memory models

Vicent Cholvi,Ernesto Jiménez,Antonio Fernández Anta

Journal of Parallel and Distributed Computing（2009）

引用 6|浏览0

暂无评分

摘要

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.

查看译文

关键词

memory system,memory model,distributed algorithms,non-fast consistency model,correctness proofs,interconnection systems,consistency model,distributed shared memory,fast consistency model,memory models,impossibility result,distributed memory,distributed algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要