Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
