Limitations of fast consistency conditions for distributed shared memories

被引：9
作者：
Attiya, H
Friedman, R
机构：
[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,IL-32000 HAIFA,ISRAEL
[2] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 57卷 / 05期
关键词：
distributed computing; distributed shared memory; consistency conditions;
D O I：
10.1016/0020-0190(96)00007-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A consistency condition for distributed shared memory is fast if it has a fast implementation in which the execution time of every operation is significantly faster than the network delay. These conditions include Pipelined RAM, weak consistency, causal memory, and one interpretation of processor consistency. It is shown that if a condition is fast then it does not support non-centralized solutions for mutual exclusion.
引用
收藏
页码：243 / 248
页数：6
相关论文
共 17 条
[1]  
Adve Sarita V., 1990, P ISCA, P2, DOI [10.1145/325164.325100, DOI 10.1145/325164.325100]
[2]  
AHAMAD M, 1990, GITCC9049 TR GEORG I
[3]  
AHAMAD M, DISTRIBUTED COMPUT, V9
[4]  
AHAMAD M, 1993, P 5 ACM ANN S PAR AL, P251
[5]   SEQUENTIAL CONSISTENCY VERSUS LINEARIZABILITY [J].
ATTIYA, H ;
WELCH, JL .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1994, 12 (02) :91-122
[6]  
Attiya H., 1992, Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, P679, DOI 10.1145/129712.129778
[7]  
ATTIYA H, 1993, 767 DEPT COMP SCI
[8]   SOLUTION OF A PROBLEM IN CONCURRENT PROGRAMMING CONTROL [J].
DIJKSTRA, EW .
COMMUNICATIONS OF THE ACM, 1965, 8 (09) :569-&
[9]  
FRIEDMAN R, DISTRIBUTED COMPUT, V9
[10]  
FRIEDMAN R, 1994, THESIS DEPT COMPUTER
12