FINDING THE MAXIMUM, MERGING, AND SORTING IN A PARALLEL COMPUTATION MODEL

被引：189

作者：

SHILOACH, Y ^{[1
]}

VISHKIN, U ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL

来源：

关键词：

D O I：

10.1016/0196-6774(81)90010-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：88 / 102

页数：15

共 17 条

[1]

ALTON DA, P HUMBOLDT STATE U C

[2]

ECKSTEIN D, 1977, THESIS U IOWA IOWA C

[3]

ECKSTEIN DM, SIAM J COMPUT

[4] PARALLELISM IN TAPE-SORTING [J].

EVEN, S .

[5] MERGING WITH PARALLEL PROCESSORS [J].

GAVRIL, F .

[6] SURVEY OF PARALLEL ALGORITHMS IN NUMERICAL LINEAR ALGEBRA [J].

HELLER, D .

[7] FAST PARALLEL SORTING ALGORITHMS [J].

HIRSCHBERG, DS .

[8] COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS [J].

HIRSCHBERG, DS ;

CHANDRA, AK ;

SARWATE, DV .

[9]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[10]

KUNG HT, ADV COMPUTERS, V19