Utility-Based Cache Partitioning A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

This paper investigates the problem of partitioning a shared cache between multiple concurrently executing applications. The commonly used LRU policy implicitly partitions a shared cache on a demand basis, giving more cache resources to the application that has a high demand and fewer cache resource...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06) s. 423 - 432
Hlavní autori:	Qureshi, Moinuddin K., Patt, Yale N.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Washington, DC, USA IEEE Computer Society 09.12.2006 IEEE
Edícia:	ACM Conferences
Predmet:	Application software Circuits Hardware Hardware > Electronic design automation > High-level and register-transfer level synthesis Hardware > Hardware validation Hardware > Integrated circuits > Semiconductor memory Hardware > Integrated circuits > Semiconductor memory > Dynamic memory Monitoring Multicore processing Partitioning algorithms Resource management Runtime Yarn
ISBN:	0769527329, 9780769527321
ISSN:	1072-4451
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!