Cover Image

A primer on compression in the memory hierarchy /

Bibliographic Details
Main Authors: Sardashti, Somayeh (Author), Arelakis, Angelos (Author), Stenström, Per (Author), Wood, David Allen (Author)
Format: eBook
Language:English
Published: San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, 2016.
Series:Synthesis lectures in computer architecture ; # 36.
Subjects:
Data compression (Computer science)
Memory hierarchy (Computer science)
cache design
data compression
energy efficiency
memory hierarchy
memory system
performance
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • 1. Introduction
  • 2. Compression algorithms
  • 2.1 Value locality
  • 2.2 Compression algorithm taxonomy
  • 2.3 Classification of compression algorithms
  • 2.3.1 Run-length encoding
  • 2.3.2 Lempel-Ziv (LZ) coding
  • 2.3.3 Huffman coding
  • 2.3.4 Frequent value compression (FVC)
  • 2.3.5 Frequent pattern compression (FPC)
  • 2.3.6 Base-delta-immediate (BDI)
  • 2.3.7 Cache packer (C-PACK)
  • 2.3.8 Deduplication
  • 2.3.9 Instruction compression
  • 2.3.10 Floating-point compression
  • 2.3.11 Hybrid compression
  • 2.4 Metrics to evaluate the success of a compression algorithm
  • 2.5 Summary
  • 3. Cache compression
  • 3.1 Cache compaction taxonomy
  • 3.2 Cache compaction mechanisms
  • 3.2.1 Simple compaction mechanisms
  • 3.2.2 Supporting variable size compression
  • 3.2.3 Decoupled compressed caches
  • 3.2.4 Skewed compressed caches
  • 3.3 Policies to manage compressed caches
  • 3.4 Cache compression to improve cache power and area
  • 3.5 Summary
  • 4. Memory compression
  • 4.1 Baseline system architecture of a compressed memory system
  • 4.2 Compression algorithms
  • 4.3 Compressed memory organizations
  • 4.3.1 The IBM MXT approach
  • 4.3.2 The Ekman/Stenstrom approach
  • 4.3.3 The decoupled zero-compression approach
  • 4.3.4 The linear compressed pages approach
  • 4.4 Summary
  • 5. Cache/memory link compression
  • 5.1 Link compression for narrow value locality
  • 5.2 Link compression for clustered value locality
  • 5.3 Link compression for temporal value locality
  • 5.3.1 The citron scheme
  • 5.3.2 Frequent value encoding
  • 5.4 Link compression methods applied to compressed memory data
  • 5.5 Summary
  • 6. Concluding remarks
  • References
  • Authors' biographies.