Embedding of rings and meshes onto faulty hypercubes using free dimensions
Journal Article
·
· IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (United States)
- Univ. of Southern California, Los Angeles, CA (United States)
Fault tolerance in hypercubes is achieved by exploiting inherent redundancy and executing tasks on faulty hypercubes. We consider tasks that require linear chain, ring, mesh, and torus structure, which are quite useful in parallel and pipeline computations. In this brief contribution, we assume the number of faults is on the order of the number of dimensions of the hypercube. Our 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. Using this approach, we obtain the following results in an n-dimensional hypercube. A ring of length 2(sup n) - 2f or a chain of length 2(sup n) - 2f + 1 can be found, given any f less than or = n - 2 faulty nodes. The length of chains or rings obtained is optimal (longest) in the worst case of fault distribution. A mesh of size at least (2(sup m(1)) - 2f + 1) * 2(sup m(2)) * ... * 2(sup m(d)), or a torus of size at least (2(sup m(1)) - 2f) * 2(sup m(2)) * ... * 2(sup m(d)), can be found when f less than or = m(sub 1) - 2, where n = m(sub 1) + m(sub 2) + ... + m(sub d) and m(sub 1) is the largest direction of mesh. A mesh or torus of size at least (2(sup m(1)) - k) * 2(sup m(2)) *... * 2(sup m(d)) can be found with dilation 2 when 1 less thanEQ f less than or = n, where k = min (f, (2(sup m(1))/2(sup n - f + 1))). 14 refs.
- OSTI ID:
- 6687158
- Journal Information:
- IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (United States) Vol. 43:5; ISSN 0018-9340; ISSN ITCOB4
- Country of Publication:
- United States
- Language:
- English
Similar Records
Embeddings, communication and performance of algorithms in faulty hypercubes
Parallel-sorting algorithms for hypercube multiprocessors
Reliable designs for massively connected multiprocessors
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:6090965
Parallel-sorting algorithms for hypercube multiprocessors
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6155985
Reliable designs for massively connected multiprocessors
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6090157