DocumentCode
1991124
Title
Connectivity and fault tolerance of multiple-bus systems
Author
Hung-Kuei Eu ; Nayes, J.P.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fYear
1994
fDate
15-17 June 1994
Firstpage
372
Lastpage
381
Abstract
We study multiple-bus computer systems that are fault tolerant in the sense that processors remain connected in the presence of component faults such as faulty processors and buses, and faulty links between processors and buses which may represent partial bus failures. We propose several graph-theoretic models for this purpose. A processor-bus-link (PBL) graph is introduced to represent a multiple-bus system component adjacency graphs derived from the PBL graph exhibit the connectivity of the system´s components, We then transform the problem of analyzing fault tolerance of multiple-bus systems into the simpler problem of finding the node connectivity of component adjacency graphs. Minimum critical fault sets, each of which is a minimum set of faulty components whose removal disconnects processors, are also characterized.<>
Keywords
fault tolerant computing; graph theory; multiprocessing systems; performance evaluation; reliability; system buses; PBL graph; component adjacency graphs; component faults; connectivity; fault tolerance; faulty links; faulty processors; graph-theoretic models; minimum critical fault sets; multiple-bus computer systems; multiple-bus system component adjacency graphs; multiple-bus systems; multiprocessor systems; node connectivity; partial bus failures; processor-bus-link; Bandwidth; Computer architecture; Computer networks; Context; Costs; Degradation; Fault tolerance; Fault tolerant systems; Laboratories; Multiprocessing systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault-Tolerant Computing, 1994. FTCS-24. Digest of Papers., Twenty-Fourth International Symposium on
Conference_Location
Austin, TX, USA
Print_ISBN
0-8186-5520-8
Type
conf
DOI
10.1109/FTCS.1994.315623
Filename
315623
Link To Document