Abstract
We propose an approach to organizing self-testing in a multiprocessor system under certain constraints; in particular, we use special diagnostic graphs, and the number of failures does not exceed a certain value T. We show that a test experiment where each of n processors is tested by two others lets one determine the state of all except possibly two processors for T = 4 and except one for T = 3. The total number of tests does not exceed 2n + 2.
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.
