loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 IEEE 13th International Symposium on High Performance Computer Architecture
Accelerating and Adapting Precomputation Threads for Effcient Prefetching
Scottsdale, AZ, USA
February 10-February 14
ISBN: 1-4244-0804-0
Weifeng Zhang, Department of Computer Science and Engineering, University of California, San Diego
Dean M. Tullsen, Department of Computer Science and Engineering, University of California, San Diego
Brad Calder, Department of Computer Science and Engineering, University of California, San Diego
Speculative precomputation enables effective cache prefetching for even irregular memory access behavior, by using an alternate thread on a multithreaded or multi-core architecture. This paper describes a system that constructs and runs precomputation based prefetching threads via event-driven dynamic optimization. Precomputation threads are dynamically constructed by a runtime compiler from the program's frequently executed hot traces, and are adapted to the memory behavior automatically. Both construction and execution of the prefetching threads happen in another thread, imposing little overhead on the main thread. This paper also presents several techniques to accelerate the precomputation threads, including colocation of p-threads with hot traces, dynamic stride prediction, and automatic adptation of runahead and jumpstart distance. The adaptive prefetching achieves 42% speedup, a 17% improvement over existing p-thread prefetching schemes.
Citation:
Weifeng Zhang, Dean M. Tullsen, Brad Calder, "Accelerating and Adapting Precomputation Threads for Effcient Prefetching," hpca, pp.85-95, 2007 IEEE 13th International Symposium on High Performance Computer Architecture, 2007
Usage of this product signifies your acceptance of the Terms of Use.