Embedding and reconfiguration of binary trees in faulty hypercubes
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Strategies for reconfiguring hypercubes under faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reconfiguring embedded task graphs in faulty hypercubes by automorphismsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Embedding of rings and meshes onto faulty hypercubes using free dimensionsIEEE Transactions on Computers, 1994
- Running algorithms efficiently on faulty hypercubes (extended abstract)ACM SIGARCH Computer Architecture News, 1991
- Reliable broadcast in hypercube multicomputersIEEE Transactions on Computers, 1988
- Communication efficient basic linear algebra computations on hypercube architecturesJournal of Parallel and Distributed Computing, 1987
- Reconfiguring a hypercube in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1987
- Embedding of tree networks into hypercubesJournal of Parallel and Distributed Computing, 1985
- Optimal BPC Permutations on a Cube Connected SIMD ComputerIEEE Transactions on Computers, 1982