Least Frequently Used Cache: The Annoying Little Brother of LRU
Detalles
LFU looks deceptively close to LRU: both caches evict the "least useful" item. We'll look at how the ordering rule affects data structure design. We'll discuss the algorithmic tradeoffs behind LFU and compare different implementation strategies, ending with benchmarks in C++ and Rust.
Date and time: 25th of June (Thursday), 6 pm
Location: Beograđanka, Vidikovac, 22nd floor
Address: Masarikova 5
Online: C++ Serbia YouTube
To join the community discussions, we are on:
See you!
