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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-12 |
| Number of pages | 12 |
| Journal | Conference Proceedings - Annual International Symposium on Computer Architecture, ISCA |
| State | Published - 2000 |
| Event | ISCA-27: The 27th Annual International Symposium on Computer Architecture - Vancouver, BC, Can Duration: Jun 10 2000 → Jun 14 2000 |
Fingerprint
Dive into the research topics of 'Scalable approach to Thread-Level Speculation'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS