Simultaneous multithreading (SMT) processors fetch instructions from several threads, increasing the available instruction level parallelism of each thread exposed to the processor. In an SMT the fetch engine decides which threads enter the processor and have priority in using resources. Hence, the fetch engine determines how shared resources are allocated, playing a key role in the final performance of the machine. When a thread experiences an L2 cache miss, critical resources can be monopolised for a long time, throttling the execution of remaining threads. Several approaches have been proposed to cope with this problem. The first contribution of this paper is the evaluation and comparison of the three best published policies addressing the long latency load problem. The second and main contributions of this paper are that we have proposed improved versions of these three policies. Our results show that the improved versions significantly enhance the original ones in both throughput and fairness.

, , , ,
International Journal of High Performance Computing and Networking
Sprott School of Business

Cazorla, F.J. (Francisco J.), Ramirez, A, Valero, M. (Mateo), & Fernandez, E. (Enrique). (2004). Optimising long-latency-load-aware fetch policies for SMT processors. International Journal of High Performance Computing and Networking, 2(1), 45–54. doi:10.1504/IJHPCN.2004.009267