A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="http://iacoma.cs.uiuc.edu:80/iacoma-papers/asplos14.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="ACM Press">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w47kezfuffdgvcobhv564rrlju" style="color: black;">Proceedings of the 19th international conference on Architectural support for programming languages and operating systems - ASPLOS '14</a>
Record and Deterministic Replay (RnR) of multithreaded programs on relaxed-consistency multiprocessors has been a long-standing problem. While there are designs that work for Total Store Ordering (TSO), finding a general solution that is able to record the access reordering allowed by any relaxedconsistency model has proved challenging. This paper presents the first complete solution for hardware-assisted memory race recording that works for any relaxed-consistency model of current processors.<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2541940.2541979">doi:10.1145/2541940.2541979</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/asplos/HonarmandT14.html">dblp:conf/asplos/HonarmandT14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dnzuwujanfgindoqi5pg6xhjru">fatcat:dnzuwujanfgindoqi5pg6xhjru</a> </span>
more »... ith the scheme, called RelaxReplay, we can build an RnR system for any relaxed-consistency model and coherence protocol. RelaxReplay's core innovation is a new way of capturing memory access reordering. Each memory instruction goes through a post-completion in-order counting step that detects any reordering, and efficiently records it. We evaluate Re-laxReplay with simulations of an 8-core release-consistent multicore running SPLASH-2 programs. We observe that RelaxReplay induces negligible overhead during recording. In addition, the average size of the log produced is comparable to the log sizes reported for existing solutions, and still very small compared to the memory bandwidth of modern machines. Finally, deterministic replay is efficient and needs minimal hardware support.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190718051148/http://iacoma.cs.uiuc.edu:80/iacoma-papers/asplos14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/ae/ccae4865d4d71565981d1fbbaa9f6e0009e5e2ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2541940.2541979"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>