| 期刊全稱 | A Primer on Compression in the Memory Hierarchy | | 影響因子2023 | Somayeh Sardashti,Angelos Arelakis,David A. Wood | | 視頻video | http://file.papertrans.cn/142/141900/141900.mp4 | | 學(xué)科分類 | Synthesis Lectures on Computer Architecture | | 圖書封面 |  | | 影響因子 | This synthesis lecture presents the current state-of-the-art in applying low-latency, lossless hardware compression algorithms to cache, memory, and the memory/cache link. There are many non-trivial challenges that must be addressed to make data compression work well in this context. First, since compressed data must be decompressed before it can be accessed, decompression latency ends up on the critical memory access path. This imposes a significant constraint on the choice of compression algorithms. Second, while conventional memory systems store fixed-size entities like data types, cache blocks, and memory pages, these entities will suddenly vary in size in a memory system that employs compression. Dealing with variable size entities in a memory system using compression has a significant impact on the way caches are organized and how to manage the resources in main memory. We systematically discuss solutions in the open literature to these problems. Chapter 2 provides the foundations of data compression by first introducing the fundamental concept of value locality. We then introduce a taxonomy of compression algorithms and show how previously proposed algorithms fit within that | | Pindex | Book 2016 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-15 06:43
發(fā)表于 2025-3-21 18:43:44
