A PARALLEL SORTING SCHEME WHOSE BASIC OPERATION SORTS N ELEMENTS

被引：5

作者：

TSENG, SS

LEE, RCT

机构：

[1] NATL TSING HUA UNIV,INST COMP & DECIS SCI,HSINCHU 300,TAIWAN

[2] NATL TSING HUA UNIV,DEPT ELECT ENGN,HSINCHU 300,TAIWAN

来源：

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES | 1985年 / 14卷 / 06期

关键词：

D O I：

10.1007/BF00991185

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

引用

页码：455 / 467

页数：13

共 29 条

[1] PARALLEL COMPLEXITY OF SORTING PROBLEMS [J].

AIGNER, M .

[2]

BARLOW H, 1981, INFOR P LETT, V13, P103

[3]

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

[4] DIAMOND - A SORTING METHOD FOR VECTOR MACHINES [J].

BROCK, HK ;

BROOKS, BJ ;

SULLIVAN, F .

BIT, 1981, 21 (02) :142-152

[5]

CHEN TC, 1978, IJCIS, V7, P293

[6]

CHIN FY, 1980, IEEE T COMPUT, V27, P618

[7]

Drysdale R. L. III, 1975, SIAM Journal on Computing, V4, P264, DOI 10.1137/0204022

[8] MERGING WITH PARALLEL PROCESSORS [J].

GAVRIL, F .

[9]

HAGGKVIST R, 1981, SIAM J COMPUT, V10, P465, DOI 10.1137/0210034

[10] FAST PARALLEL SORTING ALGORITHMS [J].

HIRSCHBERG, DS .