Embedding Rings into Faulty Twisted Hypercube
| dc.contributor.author | Bettayeb, Said | |
| dc.date.accessioned | 2020-05-04T16:31:41Z | |
| dc.date.available | 2020-05-04T16:31:41Z | |
| dc.date.issued | 1997 | |
| dc.description.abstract | Fault tolerance in hypercubes is achieved by exploiting inherent redundancy and executing tasks on faulty hypercubes. The authors consider tasks that require linear chain, ring, mesh, and torus structure, which are quite useful in parallel and pipeline computations. They assume the number of faults is on the order of the number of dimensions of the hypercube. The techniques are based on a key concept called free dimension, which can be used to partition a cube into subcubes such that each subcube contains, at most, one faulty node. Subgraphs are embedded in each subcube and then merged to form the entire graph | en_US |
| dc.identifier.citation | • Embedding Rings into Faulty Twisted Hypercubes, (with E. Abuelrub), Journal Computers and Artificial Intelligence, Vol. 16, No.4, 1997, pp. 425-441. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10657.1/2324 | |
| dc.publisher | Journal of Computers and Artificial Intelligence | en_US |
| dc.subject | Grid network OLAP cube Fault tolerance Time complexity Computation Best, worst and average case Universal quantification Embedded system | en_US |
| dc.title | Embedding Rings into Faulty Twisted Hypercube | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Embedding Rings into Faulty Twisted Hypercubes.pdf
- Size:
- 6.83 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: