Data cache management using frequency-based replacement
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Computers
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
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
Microhash: an efficient index structure for fash-based sensor devices
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
BPLRU: a buffer management scheme for improving random writes in flash storage
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
A case for flash memory ssd in enterprise database applications
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Flash Disk Opportunity for Server Applications
Queue - Enterprise Flash Storage
Proceedings of the VLDB Endowment
Migrating server storage to SSDs: analysis of tradeoffs
Proceedings of the 4th ACM European conference on Computer systems
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
CFDC: a flash-aware replacement policy for database buffer management
Proceedings of the Fifth International Workshop on Data Management on New Hardware
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
LIRS-WSR: integration of LIRS and writes sequence reordering for flash memory
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Clean first or dirty first?: a cost-aware self-adaptive buffer replacement policy
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
FD-buffer: a buffer manager for databases on flash disks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
FAB: flash-aware buffer management policy for portable media players
IEEE Transactions on Consumer Electronics
LRU-WSR: integration of LRU and writes sequence reordering for flash memory
IEEE Transactions on Consumer Electronics
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
What is a good buffer cache replacement scheme for mobile flash storage?
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
h-Buffer: an adaptive buffer management scheme for flash-based storage devices
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
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
Cooperating virtual memory and write buffer management for flash-based storage systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hybrid storage management for database systems
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
The inherent asymmetry of read and write speeds of flash memory poses great challenges for buffer management design. Most of existing flash-based buffer management policies adopt disk-oriented strategies by giving a specific priority to dirty pages, while not fully exploiting the characteristics of the flash memory. In this paper, we propose a novel buffer replacement algorithm named FOR, which stands for Flash-based Operation-aware buffer Replacement. The core idea of FOR is based on novel operation-aware page weight determination for buffer replacement. The weight metric not only measures the locality of read/write operations on a page, but also takes the cost difference of read/write operations into account. We further develop an efficient implementation FOR+ with the time complexity of O(1) for each operation. Experiments on synthetic and benchmark traces demonstrate the efficiency of the proposed strategy, which yields better performance compared with some state-of-the-art flash-based buffer management policies.