Finding optimal non-datapath caching strategies via network flow

Flash and non-volatile memory (NVM) devices have only a limited number of write-erase cycles. Consequently, when employed as caches, cache management policies may choose not to cache certain requested items in order to extend device lifespan. In this work, we propose a simple single-parameter utilit...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2023-02, Vol.945, p.113686, Article 113686
Main Authors: Lyons, Steven, Rangaswami, Raju, Xie, Ning
Format: Article
Language:English
Subjects:
Cache hit and cache write tradeoff
Network flow based algorithm
Non-datapath caching
Offline cache management
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Flash and non-volatile memory (NVM) devices have only a limited number of write-erase cycles. Consequently, when employed as caches, cache management policies may choose not to cache certain requested items in order to extend device lifespan. In this work, we propose a simple single-parameter utility function to model the trade-off between maximizing hit-rate and minimizing write-erase cycles for such caches, and study the problem of developing an off-line strategy for deciding whether to write a new item to cache, and if so which item already in the cache to replace. Our main result is, OPTm, an efficient, network flow based algorithm which finds optimal cache management policy under this new setting.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2022.12.036