1 / 10

Gennady Pekhimenko , Vivek Seshadri , Yoongu Kim, Hongyi Xin , Onur Mutlu , Todd C. Mowry

Linearly Compressed Pages: A Main Memory Compression Framework with Low Complexity and Low Latency . Phillip B. Gibbons, Michael A. Kozuch. Gennady Pekhimenko , Vivek Seshadri , Yoongu Kim, Hongyi Xin , Onur Mutlu , Todd C. Mowry. Summary. Main memory is a limited shared resource

palila
Download Presentation

Gennady Pekhimenko , Vivek Seshadri , Yoongu Kim, Hongyi Xin , Onur Mutlu , Todd C. Mowry

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Linearly Compressed Pages: A Main Memory Compression Framework with Low Complexity and Low Latency Phillip B. Gibbons, Michael A. Kozuch Gennady Pekhimenko, VivekSeshadri, Yoongu Kim, HongyiXin, OnurMutlu, Todd C. Mowry

  2. Summary • Main memory is a limited shared resource • Observation: Significant data redundancy • Old Idea: Compress data in main memory

  3. Summary • Main memory is a limited shared resource • Observation: Significant data redundancy • Old Idea: Compress data in main memory • Problem: How to avoid inefficiency in address computation?

  4. Summary • Main memory is a limited shared resource • Observation: Significant data redundancy • Old 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

  5. Summary • Main memory is a limited shared resource • Observation: Significant data redundancy • Old 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%)

  6. Linearly Compressed Pages (LCP) Uncompressed Page (4KB: 64*64B) . . . 64B 64B 64B 64B 64B

  7. Linearly Compressed Pages (LCP) Uncompressed Page (4KB: 64*64B) . . . 64B 64B 64B 64B 64B 4:1 Compression . . . Compressed Data (1KB)

  8. Linearly Compressed Pages (LCP) Uncompressed Page (4KB: 64*64B) . . . 64B 64B 64B 64B 64B 4:1 Compression . . . M Metadata (64B): ? (compressible) Compressed Data (1KB)

  9. Linearly Compressed Pages (LCP) Uncompressed Page (4KB: 64*64B) . . . 64B 64B 64B 64B 64B 4:1 Compression Exception Storage . . . M E Metadata (64B): ? (compressible) Compressed Data (1KB)

  10. Linearly Compressed Pages (LCP) Uncompressed Page (4KB: 64*64B) . . . 64B 64B 64B 64B 64B 4:1 Compression Exception Storage . . . M E Metadata (64B): ? (compressible) Compressed Data (1KB) Tomorrow, 8:30am, Session 3A

More Related