A O(t/sup 3/+ mod E mod ) fault identification algorithm for diagnosable systems
Gregory F. Sullivan · IEEE Transactions on Computers · 1988
Systems composed of many processing units can use these units to help perform self-diagnosis. An algorithm is presented that performs this type of diagnosis for the system-level fault model. The time complexity of the algorithm is O(t/sup 3/+ mod E mod ), where mod E mod is the number of tests and t is the number of allowed faults. When t is small relative to the total number of system components n, this is the tightest known time bound; when t is O(n/sup 5/6/) this is the best bound.>