Compressed DDR Storage with Cache Decompression
I've been thinking about a question concerning program execution efficiency lately and would like to hear your views.
We know the concept of information entropy, but the instructions and data actually executed by a computer are not necessarily high‑entropy (many instructions exhibit repetitive patterns, and data shows locality), which implies that there is theoretical room for compression.
Given that the "memory wall" problem is becoming increasingly prominent, and DDR bandwidth is often the bottleneck,
if we exploit the hierarchical nature of the cache and store programs in a compressed form in DDR, while decompressing them back to actual runnable instructions/data in the cache, could this effectively improve the effective bandwidth utilization for instructions and dat