Other Scholarly Content
 

Partitioning and broadcasting in hypercubes in the presence of faulty communication links

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/defaults/cz30q2272

Descriptions

Attribute NameValues
Creator
Abstract
  • The problem of broadcasting in faulty hypercubes is considered, based upon a strategy of partitioning the faulty hypercube into subcubes in which currently known algorithms can be implemented. Three similar partitioning and broadcasting algorithms for an n-dimensional hypercube in the presence of up to (n² + 2n - c) / 4 faulty communication links are presented, where c = 4 if n is an even number or c = 3 if n is an odd number. The most efficient algorithm is implemented in 1.3n + 6log(n) + 9 time units. To the best of our knowledge, this algorithm is the most efficient one for an n-dimensional hypercube in the presence of O(n²) faults.
Resource Type
Date Issued
Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language

Relationships

Parents:

This work has no parents.

Items