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 条
[11]  
HO CT, 1987, 1987 INT C PAR PROC, P188
[12]  
Ho T.K., 1998, JOINT IAPR INT WORKS, P640, DOI [10.1007/BFb0033288, DOI 10.1007/BFB0033288]
[13]   COST TRADE-OFFS IN GRAPH EMBEDDINGS, WITH APPLICATIONS [J].
HONG, JW ;
MEHLHORN, K ;
ROSENBERG, AL .
JOURNAL OF THE ACM, 1983, 30 (04) :709-728
[14]  
LAI TH, 1988, OSUCISRC1088TR30 OH
[15]  
MA YE, 1987, 1987 P INT C PAR PRO, P178
[16]   DATA MOVEMENT TECHNIQUES FOR THE PYRAMID COMPUTER [J].
MILLER, R ;
STOUT, QF .
SIAM JOURNAL ON COMPUTING, 1987, 16 (01) :38-60
[17]  
NUGENT SF, 1988, 3RD P C HYP COMP APP
[18]  
SAAD Y, 1985, RR3389 YAL U RES REP
[19]  
SAAD Y, 1985, RR428 YAL U RES REP
[20]   THE COSMIC CUBE [J].
SEITZ, CL .
COMMUNICATIONS OF THE ACM, 1985, 28 (01) :22-33
123