More Like this

1. ReViCe: Reusing Victim Cache to Prevent Speculative Cache Leakage

   https://doi.org/10.1109/SecDev45635.2020.00029  

   Kim, Sungkeun; Mahmud, Farabi; Huang, Jiayi; Majumder, Pritam; Christou, Neophytos; Muzahid, Abdullah; Tsai, Chia-Che; Kim, Eun Jung (September 2020, IEEE Secure Development (SecDev))
2. RobinHood: Tail Latency Aware Caching - Dynamic Reallocation from Cache-Rich to Cache-Poor

   Berger, Daniel; Berg, Benjamin; Zhu, Timothy; Sen, Siddhartha; Harchol-Balter, Mor (October 2018, 13th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2018)
3. Dynamic Set Stealing to Improve Cache Performance

   https://doi.org/10.1109/SBAC-PAD55451.2022.00017  

   Testa, Brady; Mirbagher-Ajorpaz, Samira; Jimenez, Daniel A. (November 2022, IEEE)
4. Mitigating False Positives in Filters: to Adapt or to Cache?

   Bender, Michael; Das, Ratish; Farach-Colton, Martin; Mo, Tianchi; Tench, David; Wang, Yung Ping (January 2021, SIAM Symposium on Algorithmic Principles of Computer System)

   A filter is adaptive if it achieves a false positive rate of " on each query independently of the answers to previous queries. Many popular filters such as Bloom filters are not adaptive—an adversary could repeat a false-positive query many times to drive the false-positive rate to 1. Bender et al. [4] formalized the definition of adaptivity and gave a provably adaptive filter, the broom filter. Mitzenmacher et al. [20] gave a filter that achieves a lower empirical false- positive rate by exploiting repetitions. We prove that an adaptive filter has a lower false- positive rate when the adversary is stochastic. Specifically, we analyze the broom filter against queries drawn from a Zipfian distribution. We validate our analysis empirically by showing that the broom filter achieves a low false-positive rate on both network traces and synthetic datasets, even when compared to a regular filter augmented with a cache for storing frequently queried items. 

   more » « less
5. Mitigating False Positives in Filters: to Adapt or to Cache?

   https://doi.org/10.1137/1.9781611976489.2  

   Bender, Michael A. (January 2021, Proc. 2nd Symposium on Algorithmic Principles of Computer System (APoCS))

   null (Ed.)