EMBEDDING MESH OF TREES IN THE HYPERCUBE

被引:27
作者
EFE, K
机构
[1] The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette
关键词
D O I
10.1016/0743-7315(91)90046-C
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Embedding one architecture in another is useful in providing architectural abstractions between different topologies. Through such embeddings the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes methods for embedding one-, two-, and three-dimensional mesh of trees in the hypercube. Similar methods may be used for embedding higher-dimensional mesh of trees. This embedding has significant practical importance in enhancing the capabilities of the hypercube since mesh of trees enable extremely fast parallel computation. © 1991.
引用
收藏
页码:222 / 230
页数:9
相关论文
共 19 条
[1]  
Bentley J. L., 1980, J ALGORITHMS, V1, P51
[2]  
BENTLEY JL, 1979, 1979 P INT C PAR PRO, P257
[3]  
Bertsekas D.P., 1989, PARALLEL DISTRIBUTED
[4]  
BHATT SN, 1986 P 27TH ANN S F, P274
[5]  
BHATT SN, 1985, YALEDCSRR43 YAL U DE
[6]   A MINIMUM AREA VLSI NETWORK FOR O(LOG N) TIME SORTING [J].
BILARDI, G ;
PREPARATA, FP .
IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (04) :336-343
[7]  
CHAN TF, 1986, IEEE T COMPUT, V35, P969, DOI 10.1109/TC.1986.1676698
[8]  
DESPHANDE SR, 1986, 1986 P INT C PAR PRO, P661
[9]  
EFE K, 1990, TR9086 TECH REP
[10]  
HIRSCHBERG DS, 1983 P J HOPKINS C I, P680