Conditional Connectivity Measures for Large Multiprocessor Systems
Document Type
Article
Publication Date
2-1994
Publication Title
IEEE Transactions on Computers
Volume
43
Issue
2
First page number:
218
Last page number:
222
Abstract
Introduces a new measure of conditional connectivity for large regular graphs by requiring each vertex to have at least g good neighbors in the graph. Based on this requirement, the vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized
Keywords
Computer network resources; Fault-tolerant computing; Hypercube networks (Computer networks); Parallel algorithms; Routing (Computer network management)
Disciplines
Computer and Systems Architecture | Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | Engineering | Signal Processing | 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.
Repository Citation
Latifi, S.,
Hegde, M.,
Naraghipour, M.
(1994).
Conditional Connectivity Measures for Large Multiprocessor Systems.
IEEE Transactions on Computers, 43(2),
218-222.