OPTIMAL MERGING AND SORTING ON THE EREW PRAM

被引：43

作者：

HAGERUP, T

RUB, C

机构：

来源：

INFORMATION PROCESSING LETTERS | 1989年 / 33卷 / 04期

关键词：

D O I：

10.1016/0020-0190(89)90138-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：181 / 185

页数：5

共 10 条

[1] PARALLEL APPROXIMATION ALGORITHMS FOR BIN PACKING [J].

ANDERSON, RJ ;

MAYR, EW ;

WARMUTH, MK .

INFORMATION AND COMPUTATION, 1989, 82 (03) :262-277

[2] ADAPTIVE BITONIC SORTING - AN OPTIMAL PARALLEL ALGORITHM FOR SHARED-MEMORY MACHINES [J].

BILARDI, G ;

NICOLAU, A .

SIAM JOURNAL ON COMPUTING, 1989, 18 (02) :216-228

[3] DETERMINISTIC COIN TOSSING WITH APPLICATIONS TO OPTIMAL PARALLEL LIST RANKING [J].

COLE, R ;

VISHKIN, U .

INFORMATION AND CONTROL, 1986, 70 (01) :32-53

[4] PARALLEL MERGE SORT [J].

COLE, R .

SIAM JOURNAL ON COMPUTING, 1988, 17 (04) :770-785

[5] PARALLEL ALGORITHMIC TECHNIQUES FOR COMBINATORIAL COMPUTATION [J].

EPPSTEIN, D ;

GALIL, Z .

ANNUAL REVIEW OF COMPUTER SCIENCE, 1988, 3 :233-283

[6]

Knuth D. E, 1998, SORTING SEARCHING AR, V3

[7] FINDING THE MAXIMUM, MERGING, AND SORTING IN A PARALLEL COMPUTATION MODEL [J].

SHILOACH, Y ;

VISHKIN, U .

JOURNAL OF ALGORITHMS, 1981, 2 (01) :88-102

[8] ON PARALLEL SEARCHING [J].

SNIR, M .

SIAM JOURNAL ON COMPUTING, 1985, 14 (03) :688-708

[9]

[No title captured]

[10]

[No title captured]

← 1 →