BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Using Dead Blocks as a Virtual Victim Cache
DTSTART:20100826T110000
DTSTAMP:20260501T113721Z
UID:888c6f07d2aeafbeb91643f053377186ab518265423bd73dc7a19585
CATEGORIES:Conferences - Seminars
DESCRIPTION:Samira Manabi KHAN\nCaches mitigate the long memory latency th
 at limits the performance of modern processors. However\, caches can be\nq
 uite inefficient. On average\, a cache block in a 2MB L2 cache is dead 59%
  of the time\, i.e.\, it will not be referenced\nagain before it is evicte
 d. Increasing cache efficiency can improve performance by reducing miss ra
 te\, or alternately\,\nimprove power and energy by allowing a smaller cach
 e with the same miss rate.\nVirtual victim Cache uses predicted dead block
 s to hold blocks evicted from other sets. When these evicted blocks\nare r
 eferenced again\, the access can be satisfied from the other set\, avoidin
 g a costly access to main memory. The\npool of predicted dead blocks act a
 s a victim cache. 
LOCATION:BC 04 https://plan.epfl.ch/?room==BC%2004
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR