@inproceedings{8e6a30d17aa0473cae9a9fcbbdb72752,
title = "Design and analysis of fault-detecting and fault-locating schedules for computation DAGs",
abstract = "This paper investigates issues concerning the construction of fault-detecting and fault-locating schedules for multiprocessor systems. We develop conditions for a schedule to be fault-detecting or fault-locating and further use these conditions to propose schemes for construction of the schedules. Lowerbounds on the length of the schedules are calculated and for the special case of binary computation trees, it is shown that our schedules meet the lowerbounds in most cases. A method for actual fault diagnosis from the results of the fault-locating schedules for binary computation trees is also proposed.",
author = "Shalini Yajnik and Jha, {Niraj K.}",
year = "1992",
language = "English (US)",
isbn = "0818626720",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",
pages = "348--351",
booktitle = "Proceedings of the International Conference on Parallel Processing",
note = "Proceedings of the 6th International Parallel Processing Symposium ; Conference date: 23-03-1992 Through 26-03-1992",
}