SCHEMES FOR FAULT-TOLERANT COMPUTING - A COMPARISON OF MODULARLY REDUNDANT AND T-DIAGNOSABLE SYSTEMS

被引：97

作者：

CHWA, KY ^{[1
]}

HAKIMI, SL ^{[1
]}

机构：

[1] NORTHWESTERN UNIV,DEPT ELECT ENGN & COMP SCI,EVANSTON,IL 60201

来源：

INFORMATION AND CONTROL | 1981年 / 49卷 / 03期

关键词：

D O I：

10.1016/S0019-9958(81)90388-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：212 / 238

页数：27

共 10 条

[1]

ASH R, 1965, INFORMATION THEORY

[2]

CHWA KY, 1980, THESIS NW U EVANSTON

[3]

Feller W., 1957, INTRO PROBABILITY TH

HAKIMI, SL .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1969, CT16 (02) :229-&

[5] CHARACTERIZATION OF CONNECTION ASSIGNMENT OF DIAGNOSABLE SYSTEMS [J].

HAKIMI, SL ;

AMIN, AT .

[6]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[7]

Knuth D.E, 1975, ART COMPUTER PROGRAM, V1

[8]

MALLELA S, 1978, IEEE T COMPUT, V27, P560, DOI 10.1109/TC.1978.1675147

[9]

MALLELA S, 1980, IEEE T COMPUT, V29, P461, DOI 10.1109/TC.1980.1675605

[10] ON CONNECTION ASSIGNMENT PROBLEM OF DIAGNOSABLE SYSTEMS [J].

PREPARATA, FP ;

METZE, G ;

CHIEN, RT .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (06) :848-+