CONDITIONAL CONNECTIVITY MEASURES FOR LARGE MULTIPROCESSOR SYSTEMS

被引：273

作者：

LATIFI, S ^{[1
]}

HEGDE, M ^{[1
]}

NARAGHIPOUR, M ^{[1
]}

机构：

[1] LOUISIANA STATE UNIV,DEPT ELECT & COMP ENGN,BATON ROUGE,LA 70803

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1994年 / 43卷 / 02期

关键词：

CONDITIONAL CONNECTIVITY; DIAMETER; HYPERCUBE; VERTEX CONNECTIVITY;

D O I：

10.1109/12.262126

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We introduce 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.

引用

页码：218 / 222

页数：5

共 9 条

[1] Akers S. B., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P393
[2] BONDY JA, 1976, GRAPH THEORY APPLICA
[3] GENERALIZED MEASURES OF FAULT TOLERANCE WITH APPLICATION TO N-CUBE NETWORKS
ESFAHANIAN, AH
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) : 1586 - 1591
[4] ESFAHANIAN AH, 1988, J INFORM PROCESSING, V27, P195
[5] Harary Frank, 1972, GRAPH THEORY
[6] Haray F., 1983, NETWORKS, V13, P346
[7] COMBINATORIAL ANALYSIS OF THE FAULT-DIAMETER OF THE N-CUBE
LATIFI, S
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (01) : 27 - 33
[8] NETWORK RESILIENCE - A MEASURE OF NETWORK FAULT TOLERANCE
NAJJAR, W
GAUDIOT, JL
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (02) : 174 - 181
[9] THE COSMIC CUBE
SEITZ, CL
[J]. COMMUNICATIONS OF THE ACM, 1985, 28 (01) : 22 - 33

← 1 →