Issue No.11 - November (1993 vol.42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.247847
<p>A new approach produces optimal signature placement for concurrent detection of processor and program-memory errors using signature monitoring. A program control-how graph, labeled with the overhead for placing a signature on each node and arc, is transformed into an undirected graph. For an order-independent signature function such as an XOR or arithmetic checksum, the undirected graph and a spanning tree algorithm are shown to produce an optimal placement in O(n log beta (n, m)) time. Cyclic codes, which are order dependent, are shown to allow significantly lower overhead than order-independent functions. Prior work suggests overhead is unrelated to signature-function type. An O(n) graph-construction algorithm produces an optimal signature placement for cyclic codes. Experimental data show that using a cyclic code and horizontal reference signatures, the new approach can reduce average performance overhead to a fraction of a percent for the SPEC89 benchmark suite, more than 9 times lower than the performance overhead of an existing O(n/sup 2/) placement algorithm.</p>
optimal graph-construction approach; program signatures; signature monitoring; concurrent detection; program-memory errors; undirected graph; XOR; arithmetic checksum; spanning tree algorithm; optimal placement; cyclic codes; optimal signature placement; SPEC89 benchmark suite; cyclic codes; error detection; fault tolerant computing; logic testing.
K.D. Wilken, "An Optimal Graph-Construction Approach to Placing Program Signatures for Signature Monitoring", IEEE Transactions on Computers, vol.42, no. 11, pp. 1372-1381, November 1993, doi:10.1109/12.247847