A Main Memory Compression Framework with Low Complexity and Low Latency Gennady Pekhimenko Vivek Seshadri Yoongu Kim Hongyi Xin Onur Mutlu Todd C Mowry ID: 579104
Download Presentation The PPT/PDF document "Linearly Compressed Pages:" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Linearly Compressed Pages: A Main Memory Compression Framework with Low Complexity and Low Latency
Gennady Pekhimenko, Vivek Seshadri , Yoongu Kim, Hongyi Xin, Onur Mutlu, Todd C. Mowry
Phillip B.
Gibbons, Michael A. KozuchSlide2
Summary2Main memory is a limited shared resource
Observation: Significant data redundancyOld Idea: Compress data in main memory Problem: How to avoid inefficiency in address computation?Solution: Linearly Compressed Pages (LCP): fixed-size cache line granularity compression 1. Increases capacity (62% on average) 2. Decreases bandwidth consumption (24%)
3
. Improves overall performance (13.9%)Slide3
Linearly Compressed Pages (LCP)3
64B64B64B64B. . .
. . .
MEMetadata (64B): ? (compressible)
ExceptionStorage4:1 Compression64B
Uncompressed Page (4kB: 64*
64B
)
Compressed
Data (1kB)