Fault-tolerant cube graphs and coding theory
- Creators
-
Bruck, Jehoshua
- Ho, Ching-Tien
Abstract
Hypercubes, meshes, tori, and Omega networks are well-known interconnection networks for parallel computers. The structure of those graphs can be described in a more general framework called cube graphs. The idea is to assume that every node in a graph with ql nodes is represented by a unique string of l symbols over GF(q). The edges are specified by a set of offsets, those are vectors of length l over GF(q), where the two endpoints of an edge are an offset apart. We study techniques for tolerating edge faults in cube graphs that are based on adding redundant edges. The redundant graph has the property that the structure of the original graph can be maintained in the presence of edge faults. Our main contribution is a technique for adding the redundant edges that utilizes constructions of error-correcting codes and generalizes existing ad hoc techniques.
Additional Information
© Copyright 1996 IEEE. Reprinted with permission. Manuscript received September 3, 1995; revised February 16, 1996. This work was supported in part by the NSF Young Investigator Award CCR-9457811, by the Sloan Research Fellowship and under a Grant from the IBM Almaden Research Center, San Jose, CA. The authors wish to thank the Editor and the referees for their comments and suggestions that helped to improve the correspondence.Files
| Name | Size | Download all |
|---|---|---|
|
md5:70396390e4bdaf40be9dcc469a1ce945
|
625.7 kB | Preview Download |
Additional details
- Eprint ID
- 5704
- Resolver ID
- CaltechAUTHORS:BRUieeetit96
- Created
-
2006-10-29Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field