MAPPING PYRAMID ALGORITHMS INTO HYPERCUBES

被引：27

作者：

LAI, TH

WHITE, W

机构：

[1] Department of Computer and Information Science, The Ohio State University, Columbus

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1990年 / 9卷 / 01期

关键词：

D O I：

10.1016/0743-7315(90)90110-B

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we present two algorithms to efficiently embed the pyramid network structure into the hypercube. Each algorithm is analyzed with respect to three specific cost gauges: expansion, dilation, and congestion. Both algorithms maintain optimal expansion and low values for the remaining cost gauges. The first algorithm has congestion two and dilation three; the second has congestion three and dilation two. © 1990.

引用

页码：42 / 54

页数：13

共 23 条

[1]

Becker B., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P283, DOI 10.1109/SFCS.1986.24

[2] ON MAPPING PARALLEL ALGORITHMS INTO PARALLEL ARCHITECTURES [J].

BERMAN, F ;

SNYDER, L .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1987, 4 (05) :439-458

[3]

Bhatt S., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P274, DOI 10.1109/SFCS.1986.38

[4]

BHATT SN, 1985, RR443 YAL U RES REP

[5]

CHAN TF, 1986, IEEE T COMPUT, V35, P969, DOI 10.1109/TC.1986.1676698

[6]

CHANG JH, 1987, 1987 P INT C PAR PRO, P780

[7] FIXED HYPERCUBE EMBEDDING [J].

CYBENKO, G ;

KRUMME, DW ;

VENKATARAMAN, KN .

INFORMATION PROCESSING LETTERS, 1987, 25 (01) :35-39

[8]

DESHPANDE SR, 1986, 1986 P INT C PAR PRO, P661

[9]

HASTAD J, 1987, 19TH P ANN ACM S THE, P274

[10]

HO CT, 1988, TR667 YAL U TECH REP

← 1 2 3 →