Towards Automatic Markov Reliability Modeling of Computer Architectures1986 - 67 pages |
Common terms and phrases
algorithm analyze architectures ARM program assumed atomic requirements Automated Reliability Modeling behavior Boolean expression Chapman-Kolmogorov equations cluster component type computer architectures computer module computer systems continuous-time described equation equivalence class ESPN evaluation exponential distribution Failed components failure rate Fault-Tolerant faulty component Figure 4-2 Cm germinal trees hard faults hybrid redundancy input category interconnection graph interconnection structure interface intermittent faults Kmap Langley Research Center Last Class Last Tree Markov process memory failed memory triad merged Minimal Subtree Modeling Model of Figure MTTF multiprocessor NASA-LaRC New_Set node number of components output parameters parse tree Petri net PMS diagram PMS interconnection PMS structure port connections probability of failure processor triad PTS's reconfigured redundancy technique redundant group reliability and availability reliability function Reliability Graph repair root Section space truncation spares specified steps subset sum-of-products system description system requirements Technical Report term corresponds time-varying Markov models transient transition matrix vertex watchdog timer Weibull distribution