A BENCHMARK PARALLEL SORT FOR SHARED MEMORY MULTIPROCESSORS

被引：20

作者：

FRANCIS, RS

MATHIESON, ID

机构：

来源：

关键词：

D O I：

10.1109/12.9738

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：1619 / 1626

页数：8

共 18 条

[1]

BAUDET G, 1978, IEEE T COMPUT, V27, P84, DOI 10.1109/TC.1978.1674957

[2]

BITTON D, 1984, COMPUT SURV, V16, P287, DOI 10.1145/2514.2516

[3]

DEMINET J, 1982, IEEE T COMPUT, V31, P278, DOI 10.1109/TC.1982.1675993

[4]

DUBOIS M, 1988, COMMUNICATION JAN

[5] ANALYSIS OF THE PERFORMANCE OF THE PARALLEL QUICKSORT METHOD [J].

EVANS, DJ ;

YOUSIF, NY .

BIT, 1985, 25 (01) :106-112

[6] THE PARALLEL NEIGHBOR SORT AND 2-WAY MERGE ALGORITHM [J].

EVANS, DJ ;

YOUSIF, NY .

[7] MERGING WITH PARALLEL PROCESSORS [J].

GAVRIL, F .

[8]

GRIES D, 1981, SCI PROGRAMMING, P344

[9]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[10]

LAKSHMIVARAHAN S, 1984, ADV COMPUT, V13, P295