On the efficacy of call graph-level thread-level speculation

Authors:
Arun Kejariwal;Milind Girkar;Xinmin Tian;Hideki Saito;Alexandru Nicolau;Alexander V. Veidenbaum;Utpal Banerjee;Constantine D. Ppoluchronopoulos
Affiliations:
Yahoo! Inc., Sunnyvale, CA, USA;Intel Corporation, Santa Clara, CA, USA;Intel Corporation, Santa Clara, CA, USA;Intel Corporation, Santa Clara, CA, USA;UCI, Irvine, CA, USA;UCI, Irvine, CA, USA;UCI, Irvine, CA, USA;UIUC, Urbana-Chapaign, IL, USA
Venue:
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Year:
2010

Citing 5
Cited 1

Speculative Versioning Cache

HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Exploiting Method-Level Parallelism in Single-Threaded Java Programs

PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
Tradeoffs in buffering speculative memory state for thread-level speculation in multiprocessors

ACM Transactions on Architecture and Code Optimization (TACO)
Exploiting reference idempotency to reduce speculative storage overflow

ACM Transactions on Programming Languages and Systems (TOPLAS)
Tight analysis of the performance potential of thread speculation using spec CPU 2006

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming

Exploitation of nested thread-level speculative parallelism on multi-core systems

Proceedings of the 7th ACM international conference on Computing frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thread-level speculation (TLS) has been proposed as a means to parallelize difficult-to-analyze sequential codes. In this paper, we present a realistic measure of the performance potential of call-graph level TLS, using the SPEC CPU2006 benchmark suite and the Intel Core 2 Duo processor.