Performance Analysis of the Randomized SIEVE/CLOCK Cache Replacement Algorithm (SIGMETRICS'26)
We introduce a randomized variant of the SIEVE/CLOCK algorithm that is scan-resistant, which uses only ⌈log2(K+1)⌉ ≥ 1 access bits per cached item, and we present a heterogeneous mean-field approximation of its performance.