Finding optimal non-datapath caching strategies via network flow

Theoretical Computer Science(2023)

引用 0|浏览6
暂无评分
摘要
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.
更多
查看译文
关键词
Offline cache management,Non-datapath caching,Network flow based algorithm,Cache hit and cache write tradeoff
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要