'1 bit counters' diaporamas de présentation

TinyLFU: A Highly Efficient Cache Admission Policy

TinyLFU: A Highly Efficient Cache Admission Policy. Gil Einziger and Roy Friedman Technion. Speaker: Gil Einziger. Caching Internet Content. The access distribution of most content is skewed Often modeled using Zipf -like functions, power-law, etc. Long Heavy Tail

704 views • 28 slides