Improved Bounds for Algorithm-Based Fault Tolerance

Daniel J. Rosenkrantz, S. S. RaviIEEE Trans. Computers 1993 · OpenReview

Abstract

Lower and upper bounds are established for the combinatorial problem of constructing minimal test sets for error detection in multiprocessor systems. The construction for detecting two errors produces minimal test sets, while that for three errors produces test sets whose size exceeds the lower bound by at most one. Also presented is a divide-and-conquer construction scheme for four or more errors.<
BibTeX
@article{rosenkrantz1993improved,
  author = {Daniel J. Rosenkrantz and S. S. Ravi},
  title = {{Improved Bounds for Algorithm-Based Fault Tolerance}},
  journal = {IEEE Trans. Computers},
  year = {1993},
  url = {https://openreview.net/forum?id=7weHljhjqrT},
}

Loading related content...

Figure