32nd Annual International Symposium on Computer Architecture (ISCA'05) Computing Architectural Vulnerability Factors for Address-Based Structures Madison, Wisconsin June 04-June 08 ISBN: 0-7695-2270-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCA.2005.18
Processor designers require estimates of the architectural vulnerability factor (AVF) of on-chip structures to make accurate soft error rate estimates. AVF is the fraction of faults from alpha particle and neutron strikes that result in user-visible errors. This paper shows how to use a performance model to calculate the AVF of address-based structures, using a data cache, a data translation buffer, and a store buffer as examples. We describe how to perform a detailed breakdown of lifetime components (e.g., fill-to-read, read-to-evict) of bits in these structures into ACE (required for architecturally correct execution), un-ACE (unnecessary for ACE), and unknown components. This lifetime analysis produces best estimate AVFs for these three structures? data arrays of 6%, 36%, and 4%, respectively. We then present a new technique, hamming-distance-one analysis, and show that it predicts surprisingly low best estimate AVFs of 0.41%, 3%, and 7.7% for the structures? tag arrays. Finally, using our lifetime analysis framework, we show how two AVF reduction techniques — periodic flushing and incremental scrubbing — can reduce the AVF by converting ACE lifetime components into un-ACE without affecting performance significantly.
Citation:
Arijit Biswas, Paul Racunas, Razvan Cheveresan, Joel Emer, Shubhendu S. Mukherjee, Ram Rangan, "Computing Architectural Vulnerability Factors for Address-Based Structures," isca, pp.532-543, 32nd Annual International Symposium on Computer Architecture (ISCA'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||