Adaptive Stride Prefetching for the Secondary Data Cache of UMA and NUMA
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.2 pp.168-176
- Publication Date
- 2000/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Computer Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ando KI, "Adaptive Stride Prefetching for the Secondary Data Cache of UMA and NUMA" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 2, pp. 168-176, February 2000, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_2_168/_p
Copy
@ARTICLE{e83-d_2_168,
author={Ando KI, },
journal={IEICE TRANSACTIONS on Information},
title={Adaptive Stride Prefetching for the Secondary Data Cache of UMA and NUMA},
year={2000},
volume={E83-D},
number={2},
pages={168-176},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Adaptive Stride Prefetching for the Secondary Data Cache of UMA and NUMA
T2 - IEICE TRANSACTIONS on Information
SP - 168
EP - 176
AU - Ando KI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2000
AB - 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.
ER -
English
