A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient deterministic multithreading through schedule relaxation
2011
Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles - SOSP '11
Deterministic multithreading (DMT) eliminates many pernicious software problems caused by nondeterminism. It works by constraining a program to repeat the same thread interleavings, or schedules, when given same input. Despite much recent research, it remains an open challenge to build both deterministic and efficient DMT systems for general programs on commodity hardware. To deterministically resolve a data race, a DMT system must enforce a deterministic schedule of shared memory accesses, or
doi:10.1145/2043556.2043588
dblp:conf/sosp/CuiWGGY11
fatcat:ko2yliepivd3hlyjt2x74guaru