This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
SEED: A Statically Greedy and Dynamically Adaptive Approach for Speculative Loop Execution
May 2013 (vol. 62 no. 5)
pp. 1004-1016
Lin Gao, University of New South Wales, Sydney
Lian Li, University of New South Wales, Sydney
Jingling Xue, University of New South Wales, Sydney
Pen-Chung Yew, University of Minnesota, Twin Cities
Research on compiler techniques for thread-level loop speculation has so far remained on studying its performance limits: loop candidates that are worthy of parallelization are manually selected by the researchers or based on extensive profiling and preexecution. It is therefore difficult to include them in a production compiler for speculative multithreaded multicore processors. In a way, existing techniques are statically adaptive ("realized"; by the researchers for different inputs) yet dynamically greedy (since all iterations of all selected loop candidates are always parallelized at run time). This paper introduces a Statically GrEEdy and Dynamically Adaptive (SEED) approach for thread-level speculation on loops that is quite different from most other existing techniques. SEED relies on the compiler to select and optimize loop candidates greedily (possibly in an input-independent way) and provides a runtime scheduler to schedule loop iterations adaptively. To select loops for parallelization at runtime (subject to program inputs), loop iterations are prioritized in terms of their potential benefits rather than their degree of speculation as in many prior studies. In our current implementation, the benefits of speculative threads are estimated by a simple yet effective cost model. It comprises a mechanism for efficiently tracing the loop nesting structures of the program and a mechanism for predicting the outcome of speculative threads. We have evaluated SEED using a set of SPECint2000 and Olden benchmarks. Compared to existing techniques with a program's loop candidates being ideally selected a priori, SEED can achieve comparable or better performance while aututomating the entire loop candidate selection process.
Index Terms:
Parallel processing,Instruction sets,Runtime,Optimization,Hardware,Dynamic scheduling,thread-level speculation,Parallel processing,Instruction sets,Runtime,Optimization,Hardware,Dynamic scheduling,speculative compilation,Loop-level speculation
Citation:
Lin Gao, Lian Li, Jingling Xue, Pen-Chung Yew, "SEED: A Statically Greedy and Dynamically Adaptive Approach for Speculative Loop Execution," IEEE Transactions on Computers, vol. 62, no. 5, pp. 1004-1016, May 2013, doi:10.1109/TC.2012.41
Usage of this product signifies your acceptance of the Terms of Use.