Executing multiple threads has proved to be an effective solution to partially hide latencies that appear in a processor. When a thread is stalled because of a long-latency operation is being processed, such as a memory access or a floating-point calculation, the processor can switch to another context so that another thread can take advantage of the idle resources. However, fetch stall conditions caused by a branch predictor delay are not hidden by current simultaneous multithreading (SMT) fetch designs, causing a performance drop due to the absence of instructions to execute. In this paper, we propose several solutions to reduce the effect of branch predictor delay in the performance of SMT processors. Firstly, we analyse the impact of varying the number of access ports. Secondly, we describe a decoupled implementation of an SMT fetch unit that helps to tolerate the predictor delay. Finally, we present an interthread pipelined branch predictor, based on creating a pipeline of interleaved predictions from different threads. Our results show that, combining all the proposed techniques, the performance obtained is similar to that obtained using an ideal, 1-cycle access branch predictor.

Additional Metadata
Keywords branch predictor delay, decoupled predictor, fetch engine, predictor pipelining, SMT
Persistent URL dx.doi.org/10.1504/IJHPCN.2004.009264
Journal International Journal of High Performance Computing and Networking
Citation
Falcón, A. (Ayose), Santana, O.J. (Oliverio J.), Ramirez, A, & Valero, M. (Mateo). (2004). A latency-conscious SMT branch prediction architecture. International Journal of High Performance Computing and Networking, 2(1), 11–21. doi:10.1504/IJHPCN.2004.009264