This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Automatic Generation of Symbolic Reliability Functions for Processor-Memory-Switch Structures
August 1982 (vol. 31 no. 8)
pp. 752-771
V. Kini, Information Sciences Institute, University of Southern California
Calculation of the reliability of computer system architectures with built-in redundancy, such as multiprocessors, is gaining in importance. The task of computing the reliability function for arbitrary Processor-Memory-Switch (PMS) interconnection structures, however, is tedious and prone to human error. Existing reliability computation programs make one of two assumptions: ? That the case analysis of success states of the system has been carried out. Such analysis must be done manually. In this instance, input to the program is usually in the form of an intermediate representation (e.g., fault tree, reliability graph). ? That the interconnection structure is a member of, or can be partitioned into, some limited class of structures for which a parametric family of equations exists (e.g., N-modular redundant systems, hybrid redundant systems).
Index Terms:
symbolic hard-failure reliability functions, Automatic generation of symbolic reliability functions, processor-memory-switch (PMS) structures, reliability computation program
Citation:
V. Kini, D.P. Siewiorek, "Automatic Generation of Symbolic Reliability Functions for Processor-Memory-Switch Structures," IEEE Transactions on Computers, vol. 31, no. 8, pp. 752-771, Aug. 1982, doi:10.1109/TC.1982.1676082
Usage of this product signifies your acceptance of the Terms of Use.