EMBEDDING OF TREE NETWORKS INTO HYPERCUBES

被引：98

作者：

WU, AY

机构：

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1985年 / 2卷 / 03期

关键词：

D O I：

10.1016/0743-7315(85)90026-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：238 / 249

页数：12

共 26 条

[1]

BATCHER KE, 1980, IEEE T COMPUT, V29, P836, DOI 10.1109/TC.1980.1675684

[2] ILIAC IV SYSTEM [J].

BOUKNIGHT, WJ ;

SAMEH, AH ;

SLOTNICK, DL ;

MCINTYRE, DE ;

DENENBERG, SA ;

RANDALL, JM .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1972, 60 (04) :369-+

[3]

DEMILLE RA, 1978, P J HOPKINS C INFORM, P408

[4]

DUFF MJB, 3RD P IJCPR, P728

[5]

DYER CR, 1981, KSL51 U ILL CHIC CIR

[6]

Hanson A.R., 1980, STRUCTURED COMPUTER

[7] GRAPHS THAT ARE ALMOST BINARY-TREES [J].

HONG, JW ;

ROSENBERG, AL .

SIAM JOURNAL ON COMPUTING, 1982, 11 (02) :227-242

[8] COST TRADE-OFFS IN GRAPH EMBEDDINGS, WITH APPLICATIONS [J].

HONG, JW ;

MEHLHORN, K ;

ROSENBERG, AL .

JOURNAL OF THE ACM, 1983, 30 (04) :709-728

[9]

KUCK DJ, 1977, COMPUT SURV, V9, P29, DOI 10.1145/356683.356686

[10]

Kung H. T., 1977, High Speed Computer and Algorithm Organization, P423

← 1 2 3 →