16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007) (2007)
Sept. 15, 2007 to Sept. 19, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PACT.2007.6
Cosmin E. Oancea , University of Cambridge, UK
Alan Mycroft , University of Cambridge, UK
Rundberg and Stenstr?om introduced one of the first models for software TLS. This increases the loop parallelism by speculatively executing iterations while keeping a log of reads and writes; if a conflict occurs then mis-speculated iterations are re-executed (rollback). This is useful for code falling outside the traditional static dependence analysis framework. Their technique simulates cache-coherency hardware and is exact in that rollback only takes place when a dependence violation occurs, but the coherency overheads are too large for general practical use. <p>Our contribution is a family of abstract coherency algorithms; while being safe (detect all violations), these trade false positives (which cause unnecessary rollbacks) against coherency algorithm space and time.</p> <p>This paper gives one such algorithm.</p>
C. E. Oancea and A. Mycroft, "A Lightweight Model for Software Thread-Level Speculation (TLS)," 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)(PACT), Brasov, Romania, 2007, pp. 419.