Distributed subcube identification algorithms for reliable hypercubes

Document Type



The Hypercube is one of the most appealing topologies among the interconnection networks designed for parallel processing applications. Most of the basic parallel algorithms, developed to run on an n-cube, can run on a smaller k-cube (k < n ) with a slow-down factor of 2”-k. This partitionability of the hypercube allows algorithms to run on the Operational St&Cubes (OPSCs or sub- cubes with fault-free nodes and links) of an n-cube whose dimensions cannot be fully utilized due to failure of some nodes.


Computer network resources; Fault-tolerant computing; Hypercube networks (Computer networks); Parallel algorithms; Parallel processing (Electronic computers); Routing (Computer network management)


Computer and Systems Architecture | Computer Engineering | Digital Circuits | Digital Communications and Networking | Electrical and Computer Engineering | Systems and Communications


Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library