A scalable approach to thread-level speculation
Lists
Only you see this
Abstract
While architects understand how to build cost-effective parallel machines across a wide spectrum of machine sizes (ranging from within a single chip to large-scale servers), the real challenge is how to easily create parallel software to effectively exploit all of this raw performance potential. One promising technique for overcoming this problem is Thread-Level Speculation (TLS), which enables the compiler to optimistically create parallel threads despite uncertainty as to whether those threads are actually independent. In this paper, we propose and evaluate a design for supporting TLS that seamlessly scales to any machine size because it is a straightforward extension of writeback invalidation-based cache coherence (which itself scales both up and down). Our experimental results demonstrate that our scheme performs well on both single-chip multiprocessors and on larger-scale machines where communication latencies are twenty times larger.
BibTeX
@inproceedings{steffan2000scalable,
author = {J. Greggory Steffan and Christopher B. Colohan and Antonia Zhai and Todd C. Mowry},
title = {{A scalable approach to thread-level speculation}},
booktitle = {ACM SIGARCH Computer Architecture News},
year = {2000},
doi = {10.1145/342001.339650},
}Loading related content...