RELATIONS BETWEEN CONCURRENT-WRITE MODELS OF PARALLEL COMPUTATION

被引:65
作者
FICH, FE [1 ]
RAGDE, P [1 ]
WIGDERSON, A [1 ]
机构
[1] HEBREW UNIV JERUSALEM,JERUSALEM,ISRAEL
关键词
D O I
10.1137/0217037
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
27
引用
收藏
页码:606 / 627
页数:22
相关论文
共 27 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
BEAME P, 1986, 18TH P ANN ACM S THE, P169
[3]  
Chandra A. K., 1982, 23rd Annual Symposium on Foundations of Computer Science, P1, DOI 10.1109/SFCS.1982.3
[4]   UPPER AND LOWER TIME-BOUNDS FOR PARALLEL RANDOM-ACCESS MACHINES WITHOUT SIMULTANEOUS WRITES [J].
COOK, S ;
DWORK, C ;
REISCHUK, R .
SIAM JOURNAL ON COMPUTING, 1986, 15 (01) :87-97
[5]  
FICH FE, IN PRESS ADV COMPUTI
[6]  
FICH FE, 1987, IN PRESS ALGORITHMIC
[7]  
FICH FE, 1984, 3RD P ANN ACM S PRIN, P179
[8]  
GALIL Z, 1984, 16TH P ACM S THEOR C, P240
[9]   A UNIVERSAL INTERCONNECTION PATTERN FOR PARALLEL COMPUTERS [J].
GOLDSCHLAGER, LM .
JOURNAL OF THE ACM, 1982, 29 (04) :1073-1086
[10]  
GREENBERG A, 1983, THESIS U WASHINGTON