DocumentCode :
1026126
Title :
Conditional connectivity measures for large multiprocessor systems
Author :
Latifi, Sara ; Hegde, M. ; Naraghi-Pour, Morteza
Author_Institution :
Dept. of Electr. & Comput. Eng., Nevada Univ., Las Vegas, NV, USA
Volume :
43
Issue :
2
fYear :
1994
fDate :
2/1/1994 12:00:00 AM
Firstpage :
218
Lastpage :
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 :
fault tolerant computing; hypercube networks; multiprocessing systems; conditional connectivity; hypercube; large regular graphs; multiprocessor systems; n-dimensional cube; vertex connectivity; Acceleration; Concurrent computing; Degradation; Fault tolerance; Hypercubes; Multiprocessing systems; Network topology; Quantum mechanics; Resilience; Resource management;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.262126
Filename :
262126
Link To Document :
بازگشت