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 条
[11]  
Kannan R., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P7, DOI 10.1109/SFCS.1984.715895
[12]   PARALLEL COMPUTATION AND CONFLICTS IN MEMORY ACCESS [J].
KUCERA, L .
INFORMATION PROCESSING LETTERS, 1982, 14 (02) :93-96
[13]  
LI M, 1986, 18TH P ACM S THEOR C, P177
[14]  
LI M, 1985, CISRCTR867 OH STAT U
[15]  
Meyer auf der Heide F., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P532, DOI 10.1109/SFCS.1985.58
[16]  
Paul W. J., 1976, Theoretical Computer Science, V2, P383, DOI 10.1016/0304-3975(76)90089-X
[17]  
RAGDE P, 1986, THESIS U CALIFORNIA
[18]  
RAGDE PL, IN PRESS SIAM J DISC
[19]  
REISCHUK R, 1984, UNPUB SIMULTANEOUS W
[20]   FINDING THE MAXIMUM, MERGING, AND SORTING IN A PARALLEL COMPUTATION MODEL [J].
SHILOACH, Y ;
VISHKIN, U .
JOURNAL OF ALGORITHMS, 1981, 2 (01) :88-102