Embedding binomial trees in faulty hypercube multiprocessors

Author

• Yinqiu. Luo

Author Type

Graduate Student

Date of Award

1996

Document Type

Thesis

Publication Status

Version of Record

Submission Date

October 2026

Thesis/Dissertation Advisor [Chair]

Wu, Jie

Abstract

We study the embedding of binomial trees with variable roots in faulty hypercubes. Based on novel embedding strategies, we propose three embedding algorithms with variable nodes as the root. The first algorithm can tolerate up to n - 1 faulty links, but the execution can be done within log2(n - 1) subcube splits. The second one can tolerate up to [(3(n - 1))\2] faulty links. The last one can tolerate up to [(3(n - 4))\2] faulty nodes.

Extent

113 p.

Comments

College of Engineering and Computer Science|FAU Electronic Theses and Dissertations Collection|Thesis (M.S.C.S.)--Florida Atlantic University, 1996.|College of Engineering and Computer Science

Recommended Citation

Luo, Yinqiu., "Embedding binomial trees in faulty hypercube multiprocessors" (1996). Electronic Theses and Dissertations 1990 - 1999. 914.
https://digitalcommons.fau.edu/etd_general_4/914

Identifier

FADT15345

Format

pdf