Minimum congestion embedding of complete binary trees into tori

被引：0

作者：

Matsubayashi, Akira ^{[1
,2
]}

Takasu, Ryo ^{[1
]}

机构：

[1] Faculty of Engineering, Utsunomiya University

[2] Faculty of Engineering, Kanazawa Universityy

来源：

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | 2000年 / E83-A卷 / 09期

关键词：

Embedded systems - Parallel algorithms - Trees (mathematics);

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We consider the problem of embedding complete binary trees into 2-dimensional tori with minimum (edge) congestion. The embedding proposed here achieves the minimum congestion and an almost minimum size of a torus (up to the constant term of 1). In particular, the embedding is optimal for the problem of embedding a 2n-1-vertex complete binary tree with an even integer n into a square torus with unit congestion.

引用

页码：1804 / 1808

共 50 条

[1] Minimum congestion embedding of complete binary trees into tori
Mitsubayashi, A
Takasu, R
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (09): : 1804 - 1808
[2] Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Manuel, Paul
DISCRETE APPLIED MATHEMATICS, 2011, 159 (05) : 360 - 366
[3] Embedding of congestion-free complete binary trees with dilation two in star graphs
Chen, YS
Tseng, YC
Juang, TY
Chang, CJ
ICA(3)PP 97 - 1997 3RD INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, 1997, : 331 - 344
[4] Embedding hierarchical folded cubes into linear arrays and complete binary trees with minimum wirelength
Guo, Ruyan
Wang, Yan
Fan, Jianxi
Fan, Weibei
JOURNAL OF SUPERCOMPUTING, 2023, 79 (10): : 11300 - 11327
[5] Embedding hierarchical folded cubes into linear arrays and complete binary trees with minimum wirelength
Ruyan Guo
Yan Wang
Jianxi Fan
Weibei Fan
The Journal of Supercomputing, 2023, 79 : 11300 - 11327
[6] Congestion-free, dilation-2 embedding of complete binary trees into star graphs
Tseng, YC
Chen, YS
Juang, TY
Chang, CJ
NETWORKS, 1999, 33 (03) : 221 - 231
[7] Embedding complete binary trees in product graphs
Broadwater, A
Efe, K
Fernandez, A
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 56 - 66
[8] Embedding complete binary trees into parity cubes
Zhao Liu
Jianxi Fan
Xiaohua Jia
The Journal of Supercomputing, 2015, 71 : 1 - 27
[9] Embedding complete binary trees in product graphs
Efe, K
Broadwater, AL
Fernandez, A
TELECOMMUNICATION SYSTEMS, 2000, 13 (01) : 99 - 109
[10] EMBEDDING COMPLETE BINARY-TREES INTO HYPERCUBES
LEISS, EL
REDDY, HN
INFORMATION PROCESSING LETTERS, 1991, 38 (04) : 197 - 199

← 1 2 3 4 5 →