The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2007)
Brasov, Romania
Sept. 15, 2007 to Sept. 19, 2007
ISSN: 1089-795X
ISBN: 0-7695-2944-5
pp: 419
Cosmin E. Oancea , University of Cambridge, UK
Alan Mycroft , University of Cambridge, UK
ABSTRACT
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>
INDEX TERMS
null
CITATION
Cosmin E. Oancea, Alan Mycroft, "A Lightweight Model for Software Thread-Level Speculation (TLS)", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 419, 2007, doi:10.1109/PACT.2007.6
81 ms
(Ver 3.3 (11022016))