PROBLEMY PROJEKTOWANIA ALGORYTMÓW AUTODIAGNOSTYKI NA POZIOMIE SYSTEMU

The paper deals with the problem of developing probabilistic algorithm for system level self-diagnosis. The main goal of the suggested algorithm is to minimize the mean time of its executing. The algorithm is based on the computing of the posterior probability of fault-free state of each system unit. Final decision about unit’s state is made on the chosen decision rule. The execution of the probabilistic algorithm is elucidated with the help of simple example and then explained for the case of more complex systems.Artykuł opisuje problem projektowania probabilistycznego algorytmu autodiagnostyki na poziomie systemu. Głównym celem proponowanego algorytmu jest minimalizacja średniego czasu wykonania. Algorytm oparty jest na obliczeniach prawdopodobieństwa a posteriori bezawaryjnego stanu każdej jednostki systemu. Decyzja o stanie jednostki podejmowana jest na podstawie wybranej reguły decyzyjnej. Działanie algorytmu probabilistycznego zostało opisane na prostym przykładzie, a następnie wyjaśnione dla przypadku bardziej złożonych systemów

Analysis and design of algorithm-based fault-tolerant systems

An important consideration in the design of high performance multiprocessor systems is to ensure the correctness of the results computed in the presence of transient and intermittent failures. Concurrent error detection and correction have been applied to such systems in order to achieve reliability. Algorithm Based Fault Tolerance (ABFT) was suggested as a cost-effective concurrent error detection scheme. The research was motivated by the complexity involved in the analysis and design of ABFT systems. To that end, a matrix-based model was developed and, based on that, algorithms for both the design and analysis of ABFT systems are formulated. These algorithms are less complex than the existing ones. In order to reduce the complexity further, a hierarchical approach is developed for the analysis of large systems