✦ LIBER ✦

Optimal Embedding of Complete Binary Trees into Lines and Grid

✍ Scribed by Ralf Heckmann; Ralf Klasing; Burkhard Monien; Walter Unger

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 179 KB
Volume: 49
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1424

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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