Adaptive Stride Prefetching for the Secondary Data Cache of UMA and NUMA

Ando KI  

IEICE TRANSACTIONS on Information and Systems   Vol.E83-D   No.2   pp.168-176
Publication Date: 2000/02/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer Systems
prefetching,  stride,  adaptive stride,  pending stall,  UMA,  NUMA,  

Full Text: PDF(641.1KB)>>
Buy this Article

Prefetching is a promising approach to tackle the memory latency problem. Two basic variants of hardware data prefetching methods are sequential prefetching and stride prefetching. The latter based on stride calculation of future references has the potential to out-perform the former which is based on the data locality. In this paper, a typical stride prefetching and its improved version, adaptive stride prefetching, are compared in quantitative way using simulation for some parallel benchmark programs in the context of uniform memory access and non-uniform memory access architectures. The simulation results show that adaptability of stride is essential since the proposed adaptive scheme can reduce pending stall time which is large in the typical scheme.