IMPLEMENTATION OF SIMULTANEOUS MEMORY ADDRESS ACCESS IN MODELS THAT FORBID IT

被引:62
作者
VISHKIN, U [1 ]
机构
[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
关键词
D O I
10.1016/0196-6774(83)90033-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:45 / 50
页数:6
相关论文
共 19 条
[1]  
ARJOMANDI E, 1975, TR86 U TOR DEP COMP
[2]  
ECKSTEIN D, 1977, THESIS U IOWA IOWA C
[3]  
ECKSTEIN DM, SIAM J COMPUT
[4]  
ECKSTEIN DM, 1979, TR796 IOW STAT U COM
[5]   MERGING WITH PARALLEL PROCESSORS [J].
GAVRIL, F .
COMMUNICATIONS OF THE ACM, 1975, 18 (10) :588-591
[6]   FAST PARALLEL SORTING ALGORITHMS [J].
HIRSCHBERG, DS .
COMMUNICATIONS OF THE ACM, 1978, 21 (08) :657-661
[7]   COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS [J].
HIRSCHBERG, DS ;
CHANDRA, AK ;
SARWATE, DV .
COMMUNICATIONS OF THE ACM, 1979, 22 (08) :461-464
[8]  
JAJA J, 1980, CS8014 PENNS STAT U
[9]   A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKS [J].
LEV, GF ;
PIPPENGER, N ;
VALIANT, LG .
IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (02) :93-100
[10]  
PREPARATA FP, 1978, IEEE T COMPUT, V27, P669, DOI 10.1109/TC.1978.1675167