This paper presents a new page replacement algorithm called Adaptive Page Replacement Algorithm (APRA), aiming at reducing the number of read, write, and erase operations and thereby improving the performance of NAND flash memory based storage systems. APRA uses a learning rule to adaptively and continually revise its parameter in response to diverse workloads with different access patterns. Experiments through simulation studies showed that the proposed algorithm performs better than other page replacement algorithms like LRU, CFLRU, CFLRU/C, LRU-WSR, in terms of read and write hit counts, and number of erase operations. �� 2009 IEEE
Recently, NAND flash memory has been one of the best storage mediums for various embedded systems su...
When a page fault occurs, the operating system has to choose a page to remove from memory to make ro...
Page replacement algorithms choose pages to swap out from memory, namely when a new page needs allo...
Abstract—Flash disks are being widely used as an important alternative to conventional magnetic disk...
Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space ...
High seek and rotation overhead of magnetic hard disk drive (HDD) motivates development of storage d...
In NAND flash memory based storage systems, a flash translation layer (FTL) is usually employed to h...
The popularity of NAND flash memory has been growing rapidly in recent years, but the SSD (Solid-Sta...
Abstract-- A virtual memory system requires efficient page replacement algorithms to make a decision...
In this paper, we present a design and implementation of FD-Buffer, a cost-based adaptive buffer man...
Flash memory has been gaining more popularity as a substitution for magnetic disk. However, due to a...
Abstract: This paper is to design a short-random request absorbing structure which can be construct...
A portable media player is a consumer electronics device that is capable of storing and playing digi...
The original publication is available at www.springerlink.com.A swapping algorithm for NAND flash me...
As the capacity of the NAND flash memory increases rapidly, flash storage device needs to maintain l...
Recently, NAND flash memory has been one of the best storage mediums for various embedded systems su...
When a page fault occurs, the operating system has to choose a page to remove from memory to make ro...
Page replacement algorithms choose pages to swap out from memory, namely when a new page needs allo...
Abstract—Flash disks are being widely used as an important alternative to conventional magnetic disk...
Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space ...
High seek and rotation overhead of magnetic hard disk drive (HDD) motivates development of storage d...
In NAND flash memory based storage systems, a flash translation layer (FTL) is usually employed to h...
The popularity of NAND flash memory has been growing rapidly in recent years, but the SSD (Solid-Sta...
Abstract-- A virtual memory system requires efficient page replacement algorithms to make a decision...
In this paper, we present a design and implementation of FD-Buffer, a cost-based adaptive buffer man...
Flash memory has been gaining more popularity as a substitution for magnetic disk. However, due to a...
Abstract: This paper is to design a short-random request absorbing structure which can be construct...
A portable media player is a consumer electronics device that is capable of storing and playing digi...
The original publication is available at www.springerlink.com.A swapping algorithm for NAND flash me...
As the capacity of the NAND flash memory increases rapidly, flash storage device needs to maintain l...
Recently, NAND flash memory has been one of the best storage mediums for various embedded systems su...
When a page fault occurs, the operating system has to choose a page to remove from memory to make ro...
Page replacement algorithms choose pages to swap out from memory, namely when a new page needs allo...