Runahead Threads to improve SMT performance
- 1 February 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE 14th International Symposium on High Performance Computer Architecture
- No. 15300897,p. 149-158
Abstract
In this paper, we propose runahead threads (RaT) as a valuable solution for both reducing resource contention and exploiting memory-level parallelism in simultaneous multithreaded (SMT) processors. Our technique converts a resource intensive memory-bound thread to a speculative light thread under long-latency blocking memory operations. These speculative threads prefetch data and instructions with minimal resources, reducing critical resource conflicts between threads. We compare an SMT architecture using RaT to both state-of-the-art static fetch policies and dynamic resource control policies. In terms of throughput and fairness, our results show that RaT performs better than any other policy. The proposed mechanism improves average throughput by 37% regarding previous static fetch policies and by 28% compared to previous dynamic resource scheduling mechanisms. RaT also improves fairness by 36% and 30% respectively. In addition, the proposed mechanism permits register file size reduction of up to 60% in a SMT processor without performance degradation.Keywords
This publication has 11 references indexed in Scilit:
- FAME: FAirly MEasuring Multithreaded Architectures2007
- An L2-miss-driven early register deallocation for SMT processors2007
- Learning-Based SMT Processor Resource Distribution via Hill-Climbing2006
- Techniques for Efficient Processing in Runahead Execution Engines2005
- Dynamically Controlled Resource Allocation in SMT Processors2004
- Runahead execution: an alternative to very large instruction windows for out-of-order processors2003
- Speculative data-driven multithreading2002
- Basic block distribution analysis to find periodic behavior and simulation points in applications2002
- Threaded multiple path executionACM SIGARCH Computer Architecture News, 1998
- Exploiting choice1996