Data structures and network algorithms
Data structures and network algorithms
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Processor Control Flow Monitoring Using Signatured Instruction Streams
IEEE Transactions on Computers
A roving monitoring processor for detection of control flow errors in multiple processor systems
Microprocessing and Microprogramming - Fault tolerant computing
A linear-time algorithm for finding a minimum spanning pseudoforest
Information Processing Letters
MIPS RISC architecture
Control-Flow Checking Using Watchdog Assists and Extended-Precision Checksums
IEEE Transactions on Computers
Introduction to algorithms
Predicting program behavior using real or estimated profiles
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Postpass Code Optimization of Pipeline Constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent Error Detection Using Watchdog Processors-A Survey
IEEE Transactions on Computers
Concurrent Detection of Software and Hardware Data-Access Faults
IEEE Transactions on Computers
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Software faults: a quantifiable definition
Advances in Engineering Software
Software faults: A quantifiable definition
Advances in Engineering Software
| Hi-index | 14.98 |
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.