Title

Distributed subcube identification algorithms for reliable hypercubes

Document Type

Article

Publication Date

6-28-1991

Publication Title

Information Processing Letters

Volume

38

First page number:

315

Last page number:

321

Abstract

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.

Keywords

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

Disciplines

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

Language

English

Permissions

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.

Identifier

DOI: http://dx.doi.org/10.1016/0020-0190(91)90088-Y

UNLV article access

Search your library

Share

COinS