TBF: A memory-efficient replacement policy for flash-based caches

Abstract

The performance and capacity characteristics of flash storage make it attractive to use as a cache. Recency-based cache replacement policies rely on an in-memory full index, typically a B-tree or a hash table, that maps each object to its recency information. Even though the recency information itself may take very little space, the full index for a cache… (More)
DOI: 10.1109/ICDE.2013.6544902

Topics

13 Figures and Tables

Cite this paper

@article{Ungureanu2013TBFAM, title={TBF: A memory-efficient replacement policy for flash-based caches}, author={Cristian Ungureanu and Biplob Debnath and Stephen Rago and Akshat Aranya}, journal={2013 IEEE 29th International Conference on Data Engineering (ICDE)}, year={2013}, pages={1117-1128} }