000			04232nam a2200685 i 4500
001			8742888
003			IEEE
005			20200413152932.0
006			m eo d
007			cr cn |||m|||a
008			190630s2019 caua fob 000 0 eng d
020			_a9781681735771 _qelectronic
020			_z9781681735788 _qhardcover
020			_z9781681735764 _qpaperback
024	7		_a10.2200/S00922ED1V01Y201905CAC047 _2doi
035			_a(CaBNVSL)thg00979215
035			_a(OCoLC)1107277433
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.9.M45 _bJ353 2019eb
082	0	4	_a005.4/2 _223
100	1		_aJain, Akanksha, _eauthor.
245	1	0	_aCache replacement policies / _cAkanksha Jain and Calvin Lin.
264		1	_a[San Rafael, California] : _bMorgan & Claypool, _c2019.
300			_a1 PDF (xv, 71 pages) : _billustrations (some color).
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aSynthesis lectures in computer architecture, _x1935-3243 ; _v#47
538			_aMode of access: World Wide Web.
538			_aSystem requirements: Adobe Acrobat Reader.
500			_aPart of: Synthesis digital library of engineering and computer science.
504			_aIncludes bibliographical references (pages 63-70).
505	0		_a1. Introduction -- 2. A taxonomy of cache replacement policies -- 2.1. Coarse-grained policies -- 2.2. Fine-grained policies -- 2.3. Design considerations
505	8		_a3. Coarse-grained replacement policies -- 3.1. Recency-based policies -- 3.2. Frequency-based policies -- 3.3. Hybrid policies
505	8		_a4. Fine-grained replacement policies -- 4.1. Reuse distance prediction policies -- 4.2. Classification-based policies -- 4.3. Other prediction metrics
505	8		_a5. Richer considerations -- 5.1. Cost-aware cache replacement -- 5.2. Criticality-driven cache optimizations -- 5.3. Multi-core-aware cache management -- 5.4. Prefetch-aware cache replacement -- 5.5. Cache architecture-aware cache replacement -- 5.6. New technology considerations -- 6. Conclusions.
506			_aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510	0		_aCompendex
510	0		_aINSPEC
510	0		_aGoogle scholar
510	0		_aGoogle book search
520			_aThis 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.
530			_aAlso available in print.
588			_aTitle from PDF title page (viewed on June 26, 2019).
650		0	_aMemory management (Computer science)
650		0	_aMicroprocessors.
650		0	_aCache memory.
650		0	_aSystems software.
653			_ahardware caches
653			_acache replacement policies
653			_acache hit rate
653			_areducing memory latency
653			_areducing memory traffic
700	1		_aLin, Yun Calvin, _eauthor.
776	0	8	_iPrint version: _z9781681735764 _z9781681735788
830		0	_aSynthesis digital library of engineering and computer science.
830		0	_aSynthesis lectures in computer architecture ; _v#47.
856	4	2	_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/servlet/opac?bknumber=8742888
856	4	0	_3Abstract with links to full text _uhttps://doi.org/10.2200/S00922ED1V01Y201905CAC047
999			_c562423 _d562423