CFLRU: a replacement algorithm for flash memory
CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Design of flash-based DBMS: an in-page logging approach
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Flash Disk Opportunity for Server Applications
Queue - Enterprise Flash Storage
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
CFDC: a flash-aware replacement policy for database buffer management
Proceedings of the Fifth International Workshop on Data Management on New Hardware
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
StableBuffer: optimizing write performance for DBMS applications on flash devices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
Recently-evicted-first buffer replacement policy for flash storage devices
IEEE Transactions on Consumer Electronics
CCF-LRU: a new buffer replacement algorithm for flash memory
IEEE Transactions on Consumer Electronics
StableBuffer: optimizing write performance for DBMS applications on flash devices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Operation-aware buffer management in flash-based systems
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
An efficient method for record management in flash memory environment
Journal of Systems Architecture: the EUROMICRO Journal
The impact of solid state drive on search engine cache management
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Hi-index | 0.00 |
We design and implement FD-Buffer, a buffer manager for database systems running on flash-based disks. Unlike magnetic disks, flash media has an inherent read-write asymmetry: writes involve expensive erase operations and as a result are usually much slower than reads. Therefore, we address this asymmetry in FD-Buffer. Specifically, we use the average I/O cost per page access as opposed to the traditional miss rate as the performance metric for a buffer. We develop a new replacement policy in which we separate clean and dirty pages into two pools. The size ratio of the two pools is automatically adapted to the read-write asymmetry and the runtime workload. We evaluate FD-Buffer with trace-driven experiments on real flash disks. Our evaluation results show that our algorithm achieves up to 33% improvement on the overall performance on commodity flash disks, in comparison with the state-of-the-art flash-aware replacement policy.