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 条

[21] On fault-tolerant embedding complete binary trees into hypercubes
Chen, YW
Chung, KL
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1998, 13 (02): : 97 - 100
[22] OPTIMAL EMBEDDING OF COMPLETE BINARY-TREES INTO LINES AND GRIDS
HECKMANN, R
KLASING, R
MONIEN, B
UNGER, W
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 25 - 35
[23] Link-disjoint embedding of complete binary trees in meshes
Lee, SK
Choi, HA
NETWORKS, 1997, 30 (04) : 283 - 292
[24] Embedding large complete binary trees in hypercubes with load balancing
Efe, K
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 35 (01) : 104 - 109
[25] FAULT-TOLERANT EMBEDDING OF COMPLETE BINARY-TREES IN HYPERCUBES
CHAN, MY
LEE, SJ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (03) : 277 - 288
[26] Embedding of complete binary trees into meshes with row-column routing
Lee, SK
Choi, HA
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (05) : 493 - 497
[27] Finding minimum congestion spanning trees
Werneck, RFF
Setubal, JC
da Conceiçao, AF
ALGORITHM ENGINEERING, 1999, 1668 : 60 - 71
[28] On embedding binary trees into hypercubes
Tayu, S
Ueno, S
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2000, 83 (01): : 1 - 13
[29] DENSE EDGE-DISJOINT EMBEDDING OF COMPLETE BINARY-TREES IN THE HYPERCUBE
RAVINDRAN, S
GIBBONS, A
INFORMATION PROCESSING LETTERS, 1993, 45 (06) : 321 - 325
[30] FAULT-TOLERANT EMBEDDING MULTIPLE COMPLETE BINARY-TREES INTO HYPERCUBES
CHUNG, KL
CHEN, YW
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1995, 10 (03): : 187 - 191

← 1 2 3 4 5 →