A Cost-aware Buffer Replacement Strategy for Flash-based Databases
Sunghwan Park, Sang‐Won Park
Abstract
Sunghwan Park, Sang‐Won Park
Abstract
This paper presents an efficient buffer replacement algorithm for flash-based databases. LRU and CFLRU(clean-first LRU) are used as buffer replacement algorithms for flash-aware systems. The performance of LRU is poor when flash memory is used as a database storage. Although CFLRU which is designed for flash-aware systems reduces the number of flash operations of dirty pages, its performance can be better when considering the cost of operations in the flash memory. FTL(flash translation layer) is a system software which shows a storage as a block device. In this paper, we suggests a new method in which the page whose processing cost is minimum is processed ahead.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents an efficient buffer replacement algorithm for flash-based databases. LRU and CFLRU(clean-first LRU) are used as buffer replacement algorithms for flash-aware systems. The performance of LRU is poor when flash memory is used as a database storage. Although CFLRU which is designed for flash-aware systems reduces the number of flash operations of dirty pages, its performance can be better when considering the cost of operations in the flash memory. FTL(flash translation layer) is a system software which shows a storage as a block device. In this paper, we suggests a new method in which the page whose processing cost is minimum is processed ahead.
Key concepts: Flash file system, Computer science, Flash memory, Flash (photography), Flash memory emulator, Database, Write buffer, Operating system