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 条

[11] Embedding complete binary trees into parity cubes
Liu, Zhao
Fan, Jianxi
Jia, Xiaohua
JOURNAL OF SUPERCOMPUTING, 2015, 71 (01): : 1 - 27
[12] Embedding complete binary trees in product graphs
Kemal Efe
Adrienne L. Broadwater
Antonio Fernandez
Telecommunication Systems, 2000, 13 : 99 - 109
[13] Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength
Guo, Ruyan
Wang, Yan
Fan, Jianxi
Fan, Weibei
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024, 35 (03) : 327 - 352
[14] Optimal embedding of complete binary trees into lines and grids
Heckmann, R
Klasing, R
Monien, B
Unger, W
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 49 (01) : 40 - 56
[15] Embedding complete binary trees into star and pancake graphs
Bouabdallah, A.
Heydemann, M.C.
Opatrny, J.
Sotteau, D.
Theory of Computing Systems, 31 (03): : 279 - 305
[16] Optimal embedding of large complete binary trees into hypercubes
Chen, C.C.
Chen, R.J.
Journal of Information Science and Engineering, 1996, 12 (02):
[17] EMBEDDING COMPLETE BINARY-TREES INTO BUTTERFLY NETWORKS
GUPTA, AK
HAMBRUSCH, SE
IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (07) : 853 - 863
[18] Embedding complete binary trees into star and pancake graphs
Bouabdallah, A
Heydemann, MC
Opatrny, J
Sotteau, D
THEORY OF COMPUTING SYSTEMS, 1998, 31 (03) : 279 - 305
[19] Optimal distortion embedding of complete binary trees into lines
Kumamoto, Masao
Miyano, Eiji
INFORMATION PROCESSING LETTERS, 2012, 112 (10) : 365 - 370
[20] Embedding Complete Binary Trees into Star and Pancake Graphs
A. Bouabdallah
M. C. Heydemann
J. Opatrny
D. Sotteau
Theory of Computing Systems, 1998, 31 : 279 - 305

← 1 2 3 4 5 →