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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2000-02-25

著者

• Ki Ando

  Computer And Software Technology Laboratory Of Electronics And Telecommunications Research Institute

関連論文

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

スポンサーリンク