Memory-Side Prefetching Scheme Incorporating Dynamic Page Mode in 3D-Stacked DRAM

Modern multiprocessor systems running multiple applications concurrently exhibit irregular memory access pattern during different phases of execution. The principle of locality is hard to exploit in the presence of such irregular memory requests and may result in additional delays due to resource co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2021-11, Vol.32 (11), p.2734-2747
Main Authors: Rafique, Muhammad M., Zhu, Zhichun
Format: Article
Language:English
Subjects:
3D-stacked DRAM
Bandwidth
Buffers
Dynamic random access memory
memory bandwidth
Memory management
memory-side prefetching
Multiprocessing
Network latency
page mode
Performance enhancement
Prefetching
Program processors
Random access memory
Three-dimensional displays
Through-silicon vias
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Modern multiprocessor systems running multiple applications concurrently exhibit irregular memory access pattern during different phases of execution. The principle of locality is hard to exploit in the presence of such irregular memory requests and may result in additional delays due to resource conflicts throughout memory hierarchy. Prefetching is a promising technique to reduce the memory access latency where data is speculatively fetched ahead of time and stored in a faster memory structure like cache or dedicated prefetch buffer. The emergence of 3D-stacked DRAM provides huge internal bandwidth that makes memory-side prefetching an effective approach to improving system performance. Leveraging the unique architecture of 3D-stacked DRAM, we introduce a memory-side prefetching scheme that works in conjunction with dynamic page mode to reduce memory access latency. We introduce a novel prefetch buffer management scheme that makes intelligent replacement decision based on the utilization and recency of the prefetched data, which also serves as a guidance for future prefetching. Simulation results indicate that our approach improves performance by 21.8 percent on average, compared to a baseline scheme that prefetches a whole row on consecutive hits and implements static open page policy. Our scheme also outperforms an existing memory-side prefetching scheme by 13.2 percent on average, which dynamically adjusts the prefetch degree based on the usefulness of prefetched data.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2020.3044856