SOLVING TREE PROBLEMS ON A MESH-CONNECTED PROCESSOR ARRAY

被引：24

作者：

ATALLAH, MJ

HAMBRUSCH, SE

机构：

[1] Purdue Univ, West Lafayette, IN, USA, Purdue Univ, West Lafayette, IN, USA

来源：

INFORMATION AND CONTROL | 1986年 / 69卷 / 1-3期

关键词：

* This work was supported by the Office of Naval Research under Contract N00014-84-K-0502 and by the National Science Foundation under Grants DCR-84-51393 and DMC-84-13496;

D O I：

10.1016/S0019-9958(86)80046-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：168 / 187

页数：20

共 20 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] FINDING EULER TOURS IN PARALLEL [J].

ATALLAH, M ;

VISHKIN, U .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 29 (03) :330-337

[3]

ATALLAH MJ, 1984, J ACM, V31, P649, DOI 10.1145/828.322449

[4] PARALLEL STRONG ORIENTATION OF AN UNDIRECTED GRAPH [J].

ATALLAH, MJ .

INFORMATION PROCESSING LETTERS, 1984, 18 (01) :37-39

[5]

ATALLAH MJ, 1985, OCT P ANN ALL C COMM, P268

[6] PARALLEL EVALUATION OF GENERAL ARITHMETIC EXPRESSIONS [J].

BRENT, RP .

JOURNAL OF THE ACM, 1974, 21 (02) :201-206

[7]

GOPALAKRISHNAN PS, 1985, IEEE, P703

[8]

HAMBRUSCH SE, 1984, PARALLEL ALGORITHMS

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

HIRSCHBERG, DS ;

CHANDRA, AK ;

SARWATE, DV .

COMMUNICATIONS OF THE ACM, 1979, 22 (08) :461-464

[10]

Knuth, 2010, COMBINATORIAL ALGORI, V4

← 1 2 →