๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Embedding of complete binary trees into meshes with row-column routing

โœ Scribed by Sang-kyu Lee; Hyeong-ah Choi

Book ID
126757219
Publisher
IEEE
Year
1996
Tongue
English
Weight
461 KB
Volume
7
Category
Article
ISSN
1045-9219

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Link-disjoint embedding of complete bina
Link-disjoint embedding of complete binary trees in meshes
โœ Lee, Sang-Kyu; Choi, Hyeong-Ah ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 342 KB

We consider the problem of embedding complete binary trees into meshes with the objective of minimizing the link congestion. Gibbons and Paterson showed that a complete binary tree T p (with 2 p 0 1 nodes) can be embedded into a 2-dimensional mesh of 2 p nodes with link congestion two. Using the dim

Optimal Dynamic Embeddings of Complete B
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf

Congestion-free, dilation-2 embedding of
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
โœ Tseng, Yu-Chee; Chen, Yuh-Shyan; Juang, Tong-Ying; Chang, Chiou-Jyu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 291 KB ๐Ÿ‘ 2 views

Trees are a common structure to represent the intertask communication pattern of a parallel algorithm. In this paper, we consider the embedding of a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: (i) a congestion-free, dilati