Cache Replacement Policies

Cache Replacement Policies

EnglishPaperback / softbackPrint on demand
Jain, Akanksha
Springer, Berlin
EAN: 9783031006340
Print on demand
Delivery on Friday, 21. of August 2026
CZK 776
Common price CZK 862
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

This book summarizes the landscape of cache replacement policies for CPU data caches. The emphasis is on algorithmic issues, so the authors start by defining a taxonomy that places previous policies into two broad categories, which they refer to as coarse-grained and fine-grained policies. Each of these categories is then divided into three subcategories that describe different approaches to solving the cache replacement problem, along with summaries of significant work in each category. Richer factors, including solutions that optimize for metrics beyond cache miss rates, that are tailored to multi-core settings, that consider interactions with prefetchers, and that consider new memory technologies, are then explored. The book concludes by discussing trends and challenges for future work. This book, which assumes that readers will have a basic understanding of computer architecture and caches, will be useful to academics and practitioners across the field.
EAN 9783031006340
ISBN 3031006348
Binding Paperback / softback
Publisher Springer, Berlin
Publication date June 18, 2019
Pages 71
Language English
Dimensions 235 x 191
Country Switzerland
Readership Professional & Scholarly
Authors Jain, Akanksha; Lin Calvin
Illustrations XV, 71 p.
Series Synthesis Lectures on Computer Architecture
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.