Linearly compressed pages
2013pp. 172–184
Citations Over TimeTop 1% of 2013 papers
Gennady Pekhimenko, Vivek Seshadri, Yoongu Kim, Hongyi Xin, Onur Mutlu, Phillip B. Gibbons, Michael A. Kozuch, Todd C. Mowry
Abstract
Data compression is a promising approach for meeting the increasing memory capacity demands expected in future systems. Unfortunately, existing compression algorithms do not translate well when directly applied to main memory because they require the memory controller to perform non-trivial computation to locate a cache line within a compressed memory page, thereby increasing access latency and degrading system performance. Prior proposals for addressing this performance degradation problem are either costly or energy inefficient.
Related Papers
- → Memory system support for image processing(1999)12 cited
- → Memory system support for image processing(2003)4 cited
- → Optimization of SDRAM memory controller for high-speed operation(2022)2 cited
- Scalable and bandwidth-efficient memory subsystem design for real-time systems(2015)
- → Polymorphic Memory: A Hybrid Approach for Utilizing On-Chip Memory in Manycore Systems(2020)