אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

TinyLFU is a frequency based cache admission policy that boost effectiveness of caches. TinyLFU decides, based on the recent access history, whether it is worth admitting an accessed object into the cache at the expense of the eviction candidate. Realizing this concept is enabled through a novel approximate LFU structure, which maintains an approximate representation of the access frequency of recently accessed objects.