loading...
Dynamic Verification of End-to-End Multiprocessor Invariants
San Francisco, California June 22-June 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2003.12099382003 International Conference on Depe ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Daniel J. Sorin, Duke University
Mark D. Hill, University of Wisconsin at Madison
David A. Wood, University of Wisconsin at Madison
As implementations of shared memory multiprocessors become more complicated, hardware faults will increasingly cause errors that are difficult or impossible to detect with low-level, localized mechanisms. In this paper, we argue for dynamic verification (i.e., on-the-fly checking) of end-to-end, system-wide invariants in shared memory multiprocessors. We develop two invariant checkers based on distributed signature analysis. Our coherence-level checker dynamically verifies that every cache coherence upgrade has a corresponding downgrade elsewhere in the system. Our message-level checker verifies that all nodes in an SMP observe the same total order of broadcast requests. We use full-system simulation to show that the checkers detect the targeted errors while not significantly degrading system performance.
Citation:
Daniel J. Sorin, Mark D. Hill, David A. Wood, "Dynamic Verification of End-to-End Multiprocessor Invariants," dsn, pp.281, 2003 International Conference on Dependable Systems and Networks (DSN'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.