Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies

Hsu, Wen-Jing; Page, Carl V.; Liu, J.

doi:10.1007/3-540-55251-0_10

Search citation statements

Order By: Relevance

Paper Sections

Select...

Embedding Fibonacci Trees In Hypercubes1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1998

2008

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…9. These trees find application in parallel computation; see [13] and [20]. Clearly every Fibonacci tree F h is a height balanced tree T P h as studied in Sect.…”

Section: Embedding Fibonacci Trees In Hypercubesmentioning

confidence: 98%

Embedding height balanced trees and Fibonacci trees in hypercubes

Choudum

Raman

2008

J. Appl. Math. Comput.

View full text Add to dashboard Cite

A height balanced tree is a rooted binary tree T in which for every vertex v ∈ V (T ), the difference b T (v) between the heights of the subtrees, rooted at the left and right child of v is at most one. We show that a height-balanced treefor every non-leaf vertex. F h has f (h + 2) − 1 vertices where f (h + 2) denotes the (h + 2)th Fibonacci number. Since f (h) ∼ 2 0.694h , it follows that if F h is a subtree of Q n , then n is at least 0.694(h + 2). We prove that F h is a subtree of the hypercube of dimension approximately 0.75h.

show abstract

“…9. These trees find application in parallel computation; see [13] and [20]. Clearly every Fibonacci tree F h is a height balanced tree T P h as studied in Sect.…”

Section: Embedding Fibonacci Trees In Hypercubesmentioning

confidence: 98%

Embedding height balanced trees and Fibonacci trees in hypercubes

Choudum

Raman

2008

J. Appl. Math. Comput.

View full text Add to dashboard Cite

show abstract

“…Lo et al [6] have identified the binomial tree as an ideal computation structure for parallel divide-and-conquer algorithms. Hsu [4] showed the use of the binomial tree in prefix computation. The binomial tree structure also has been widely used in performing data accumulation (also called reduction) and data broadcasting [5].…”

Section: Introductionmentioning

confidence: 99%

Embedding of Binomial Trees in Hypercubes with Link Faults

Fernández

Luo

1998

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies

Cited by 2 publications

References 6 publications

Embedding height balanced trees and Fibonacci trees in hypercubes

Embedding height balanced trees and Fibonacci trees in hypercubes

Embedding of Binomial Trees in Hypercubes with Link Faults

Contact Info

Product

Resources

About