TY - GEN
T1 - Dependable multithreaded processing using runtime validation
AU - Chen, Kaiyu
AU - Malik, Sharad
PY - 2006
Y1 - 2006
N2 - Modern processors face growing verification and reliability challenges posed by increasing micro-architecture complexity and aggressive technology scaling. While viable approaches have been proposed to address these challenges in the context of uniprocessors, little work has been done for emerging multithreaded processors. Multithreading raises new issues for validation due to inter-thread interactions and inherent complexity of the underlying hardware. We propose an extension of the DIVA approach [1], which employs a simple checker processor to effectively validate the complex superscalar processor, to perform instructionlevel runtime validation for both intra-thread and interthread correctness properties for multithreaded execution. We present the validation methodology using a representative simultaneous-multithreaded (SMT) architecture, and briefly discuss its general applicability to other forms of multithreading. Detailed timing simulation shows this solution has low performance penalty, while providing general robustness against both operational and functional errors with relatively small hardware overhead.
AB - Modern processors face growing verification and reliability challenges posed by increasing micro-architecture complexity and aggressive technology scaling. While viable approaches have been proposed to address these challenges in the context of uniprocessors, little work has been done for emerging multithreaded processors. Multithreading raises new issues for validation due to inter-thread interactions and inherent complexity of the underlying hardware. We propose an extension of the DIVA approach [1], which employs a simple checker processor to effectively validate the complex superscalar processor, to perform instructionlevel runtime validation for both intra-thread and interthread correctness properties for multithreaded execution. We present the validation methodology using a representative simultaneous-multithreaded (SMT) architecture, and briefly discuss its general applicability to other forms of multithreading. Detailed timing simulation shows this solution has low performance penalty, while providing general robustness against both operational and functional errors with relatively small hardware overhead.
UR - http://www.scopus.com/inward/record.url?scp=40349085923&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=40349085923&partnerID=8YFLogxK
U2 - 10.1109/PRDC.2006.24
DO - 10.1109/PRDC.2006.24
M3 - Conference contribution
AN - SCOPUS:40349085923
SN - 0769527248
SN - 9780769527246
T3 - Proceedings - 12th Pacific Rim International Symposium on Dependable Computing, PRDC 2006
SP - 275
EP - 284
BT - Proceedings - 12th Pacific Rim International Symposium on Dependable Computing, PRDC 2006
T2 - 12th Pacific Rim International Symposium on Dependable Computing, PRDC 2006
Y2 - 18 December 2006 through 20 December 2006
ER -