Share
Fr. 40.50
Angelos Arelakis, Somayeh Sardashti, Pe Stenström, Per Stenström, David A. Wood
A Primer on Compression in the Memory Hierarchy
English · Paperback / Softback
Shipping usually within 1 to 2 weeks (title will be printed to order)
Description
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 logical framework. Chapter 3 discusses the different ways that cache memory systems can employ compression, focusing on the trade-offs between latency, capacity, and complexity of alternative ways to compact compressed cache blocks. Chapter 4 discusses issues in applying data compression to main memory and Chapter 5 covers techniques for compressing data on the cache-to-memory links. This book should help a skilled memory system designer understand the fundamental challenges in applying compression to the memory hierarchy and introduce him/her to the state-of-the-art techniques in addressing them.
List of contents
List of Figures.- List of Tables.- Preface.- Acknowledgments.- Introduction.- Compression Algorithms.- Cache Compression.- Memory Compression.- Cache/Memory Link Compression.- Concluding Remarks.- References.- Authors' Biographies .
About the author
Dr. Somayeh Sardashti earned her Ph.D. degree in Computer Sciences from the University of Wisconsin-Madison. Her research interests include computer systems and architecture, high performance and energy-optimized memory hierarchies, exploiting new memory, and hardware technologies for high performance database systems. She currently works in Exadata Storage Server and Database Machine group at Oracle Corporation. She was the winner of the ACM student research competition at Grace Hopper conference in 2013. She holds an M.S. in Computer Sciences from the University of Wisconsin-Madison, another Master's degree, and a B.S. in computer engineering from the University of Tehran.
Product details
Authors | Angelos Arelakis, Somayeh Sardashti, Pe Stenström, Per Stenström, David A. Wood |
Publisher | Springer, Berlin |
Original title | A Primer on Compression in the Memory Hierarchy |
Languages | English |
Product format | Paperback / Softback |
Released | 01.01.2015 |
EAN | 9783031006234 |
ISBN | 978-3-0-3100623-4 |
No. of pages | 70 |
Dimensions | 191 mm x 5 mm x 235 mm |
Illustrations | XVIII, 70 p. |
Series |
Synthesis Lectures on Computer Architecture |
Subject |
Natural sciences, medicine, IT, technology
> Technology
> Electronics, electrical engineering, communications engineering
|
Customer reviews
No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.
Write a review
Thumbs up or thumbs down? Write your own review.