Efficient Replacement Algorithm for Flash Memory

Xiaoyan Xiang · Journal of Chinese Computer Systems · 2010

With rapid increase of the density of flash memory and the emergence of new flash-based applications,it becomes a critical issue to provide efficient buffer management for flash memory.Different from magnetic disk,flash memory has several distinct characteristics.Therefore,it will result in poor performance to directly apply traditional magnetic-disk-based page replacement algorithms on flash.This paper focuses on the distinct characteristics of flash memory,such as asymmetric read/write speed,and presents a novel efficient flash-based buffer page replacement algorithm,called LEAC.LEAC evaluates the expected flash access costs of pages according to their read/write loads and read/write speed of flash memory,and replaces the page with least expected access cost first.The experimental results showed that LEAC could significantly reduce flash access cost.

Read the paper · More papers on PaperTik