A comparison connection assignment for diagnosis of multiprocessor systems
M Malek - Proceedings of the 7th annual symposium on …, 1980 - dl.acm.org
Proceedings of the 7th annual symposium on Computer Architecture, 1980•dl.acm.org
A comparison method for diagnosis of multiprocessor systems is introduced. Given a system
of n units modeled by a linear graph, problems of finding the minimum number of
comparison edges required for fault detection and fault location are solved by the use of a
covering algorithm. The bounds for the number of comparison edges, the number of
necessary comparisons and test cycles in fault detection and fault location in systems with n
units are determined and an algorithm for an optimal comparison connection assignment is …
of n units modeled by a linear graph, problems of finding the minimum number of
comparison edges required for fault detection and fault location are solved by the use of a
covering algorithm. The bounds for the number of comparison edges, the number of
necessary comparisons and test cycles in fault detection and fault location in systems with n
units are determined and an algorithm for an optimal comparison connection assignment is …
A comparison method for diagnosis of multiprocessor systems is introduced. Given a system of n units modeled by a linear graph, problems of finding the minimum number of comparison edges required for fault detection and fault location are solved by the use of a covering algorithm. The bounds for the number of comparison edges, the number of necessary comparisons and test cycles in fault detection and fault location in systems with n units are determined and an algorithm for an optimal comparison connection assignment is given. Simplicity and ease of implementation make the described method applicable for fault detection and location in multiprocessor systems.
ACM Digital Library以上显示的是最相近的搜索结果。 查看全部搜索结果