BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20151025T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20160327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.7244.field_data.0@www.diag.uniroma1.it
DTSTAMP:20260415T100430Z
CREATED:20160212T123620Z
DESCRIPTION:In this talk\, I introduce a frequency based cache admission po
 licy in order to boost the effectiveness of caches subject to skewed acces
 s distributions. Given a newly accessed item and an eviction candidate fro
 m the cache\, our scheme decides\, based on the recent access history\, wh
 ether it is worth admitting the new item into the cache at the expense of 
 the eviction candidate.Realizing this concept is enabled through a novel a
 pproximate LFU structure called TinyLFU\, which maintains an approximate r
 epresentation of the access frequency of a large sample of recently access
 ed items. TinyLFU is very compact and light-weight as it builds upon Bloom
  filter theory.   I will present a study of the properties of TinyLFU thro
 ugh simulations of both synthetic workloads as well as multiple real trace
 s from several sources. These simulations exhibit the performance boost ob
 tained by enhancing various replacement policies with the TinyLFU eviction
  policy. Also\, a new combined replacement and eviction policy scheme nick
 named W-TinyLFU will be presented. W-TinyLFU will be demonstrated to obtai
 n equal or better hit-ratios than other state of the art replacement polic
 ies (including ARC and LIRS) on these traces. It is the only scheme to obt
 ain such good results on all traces.An open source implementation of TinyL
 FU and W-TinyLFU is available as part of the Caffeine Java 8 high performa
 nce caching library. * Joint work with Gil Einziger and Ben Man  BioRoy Fr
 iedman is an associate professor in the department of Computer Science at 
 the Technion - Israel Institute of Technology. His research interests incl
 ude Distributed Systems with emphasis on Fault-Tolerance\, Dependability\,
  High Availability\, Consistency\, Mobile Computing\, Mobile Ad-Hoc Networ
 ks. Roy Friedman serves as associate editor for IEEE TDSC and has served a
 s PC co-chair for ACM DEBS\, ACM SYSTOR and Autonomics 2009\, as well as v
 ice chair for IEEE ICDCS and EuroPar. Formerly\, Roy Friedman was an acade
 mic specialist at INRIA (France) and a researcher at Cornell University (U
 SA). He is a founder of PolyServe Inc. (acquired by HP) and holds a Ph.D. 
 and a B.Sc. from the Technion. 
DTSTART;TZID=Europe/Paris:20160223T113000
DTEND;TZID=Europe/Paris:20160223T113000
LAST-MODIFIED:20190805T155749Z
LOCATION:Aula Magna
SUMMARY:TinyLFU: A Highly Efficient Cache Admission Policy - Roy Friedman
URL;TYPE=URI:http://www.diag.uniroma1.it/node/7244
END:VEVENT
END:VCALENDAR