|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2008 International Symposium on Computer Architecture
Rerun: Exploiting Episodes for Lightweight Memory Race Recording
June 21-June 25
ISBN: 978-0-7695-3174-8
| ASCII Text | x | ||
| Derek R. Hower, Mark D. Hill, "Rerun: Exploiting Episodes for Lightweight Memory Race Recording," Computer Architecture, International Symposium on, pp. 265-276, 2008 International Symposium on Computer Architecture, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/ISCA.2008.26, author = {Derek R. Hower and Mark D. Hill}, title = {Rerun: Exploiting Episodes for Lightweight Memory Race Recording}, journal ={Computer Architecture, International Symposium on}, volume = {0}, year = {2008}, issn = {1063-6897}, pages = {265-276}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCA.2008.26}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer Architecture, International Symposium on TI - Rerun: Exploiting Episodes for Lightweight Memory Race Recording SN - 1063-6897 SP265 EP276 A1 - Derek R. Hower, A1 - Mark D. Hill, PY - 2008 KW - Multicore KW - Determinism KW - Race Recording VL - 0 JA - Computer Architecture, International Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCA.2008.26
Multiprocessor deterministic replay has many potential uses in the era of multicore computing, including enhanced debugging, fault tolerance, and intrusion detection. While sources of nondeterminism in a uniprocessor can be recorded efficiently in software, it seems likely that hardware support will be needed in a multiprocessor environment where the outcome of memory races must also be recorded.We develop a memory race recording mechanism, called Rerun, that uses small hardware state (~166 bytes/core), writes a small race log (~4 bytes/kilo- instruction), and operates well as the number of cores per system scales (e.g., to16cores). Rerun exploits the dual of conventional wisdom in race recording: Rather than record information about individual memory accesses that conflict, we record how long a thread executes without conflicting with other threads. In particular, Rerun passively creates atomic episodes.??Each episode is a dynamic instruction sequence that a thread happens to execute without interacting with other threads. Rerun uses Lamport Clocks to order episodes and enable replay of an equivalent execution.
Index Terms:
Multicore, Determinism, Race Recording
Citation:
Derek R. Hower, Mark D. Hill, "Rerun: Exploiting Episodes for Lightweight Memory Race Recording," isca, pp.265-276, 2008 International Symposium on Computer Architecture, 2008
Usage of this product signifies your acceptance of the Terms of Use.
