ADAPTIVE BITONIC SORTING - AN OPTIMAL PARALLEL ALGORITHM FOR SHARED-MEMORY MACHINES

被引:57
作者
BILARDI, G
NICOLAU, A
机构
关键词
D O I
10.1137/0218014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:216 / 228
页数:13
相关论文
共 26 条
[1]  
AKL SG, 1985, 1ST P INT C SUP SYST, P205
[2]   AN ARCHITECTURE FOR BITONIC SORTING WITH OPTIMAL VLSI PERFORMANCE [J].
BILARDI, G ;
PREPARATA, FP .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (07) :646-651
[3]  
BILARDI G, 1985, 23RD P ANN ALL C COM, P261
[4]  
BILARDI G, IN PRESS IEEE T COMP
[5]   ROUTING, MERGING, AND SORTING ON PARALLEL MODELS OF COMPUTATION [J].
BORODIN, A ;
HOPCROFT, JE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) :130-145
[6]  
COLE R, 1987, 278 NEW YORK U COMP
[7]  
HAGGKVIST R, 1981, SIAM J COMPUT, V10, P465, DOI 10.1137/0210034
[8]  
HONG Z, 1982, 14TH P ANN ACM S THE, P296
[9]  
Knuth D. E, 1998, SORTING SEARCHING AR, V3
[10]  
KRUSKAL CP, 1983, IEEE T COMPUT, V32, P942, DOI 10.1109/TC.1983.1676138