Speculative precomputation

Citations Over TimeTop 1% of 2001 papers

Abstract

This paper explores Speculative Precomputation, a technique that uses idle thread context in a multithreaded architecture to improve performance of single-threaded applications. It attacks program stalls from data cache misses by pre-computing future memory accesses in available thread contexts, and prefetching these data. This technique is evaluated by simulating the performance of a research processor based on the Itanium™ ISA supporting Simultaneous Multithreading. Two primary forms of Speculative Precomputation are evaluated. If only the non-speculative thread spawns speculative threads, performance gains of up to 30% are achieved when assuming ideal hardware. However, this speedup drops considerably with more realistic hardware assumptions. Permitting speculative threads to directly spawn additional speculative threads reduces the overhead associated with spawning threads and enables significantly more aggressive speculation, overcoming this limitation. Even with realistic costs for spawning threads, speedups as high as 169% are achieved, with an average speedup of 76%.

Related Papers

• → Fairness and Throughput in Switch on Event Multithreading(2006)56 cited
• → Fairness enforcement in switch on event multithreading(2007)36 cited
• → An Adaptive Thread Partitioning Approach in Speculative Multithreading(2020)1 cited
• → Evaluation of a speculative multithreading compiler by characterizing program dependences(2005)
• → Enhanced interleaved multithreaded multiprocessors and their performance analysis(2004)