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

Other Scholarly Content

Analytics

Citeable URL: https://ir.library.oregonstate.edu/concern/defaults/cz30q2272

Attribute Name	Values
Creator	Lee, Suckjun
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	Research Paper
Date Issued	1993-11
Academic Affiliation	Computer Science
Rights Statement	In Copyright
Publisher	Oregon State University. Department of Computer Science
Peer Reviewed	No
Language	English [eng]

Thumbnail	Title	Date Uploaded	Visibility	Actions
	Lee_Suckjun_1993_11.pdf	2023-03-23	Public	Download