A Relative Reference Responsive LRU based Page Replacement Algorithm for NAND Flash Memory

Title

A Relative Reference Responsive LRU based Page Replacement Algorithm for NAND Flash Memory

Creator

Paulson H.; Rajesh R.

Description

The acceptance of NAND flash memories in the electronic world, due to its non-volatility, high density, low power consumption, small size and fast access speed is hopeful. Due to the limitations in life span and wear levelling, this memory needs special attention in its management techniques compared to the conventional techniques used in hard disks. In this paper, an efficient page replacement algorithm is proposed for NAND flash based memory systems. The proposed algorithm focuses on decision making policies based on the relative reference ratio of pages in memory. The size adjustable eviction window and the relative reference based shadow list management technique proposed by the algorithm contribute much to the efficiency in page replacement procedure. The simulation tool based experiments conducted shows that the proposed algorithm performs superior to the well-known flash based page replacement algorithms with regard to page hit ratio and memory read/write operations. 2021, Webology. All Rights Reserved.

Source

Webology, Vol-18, No. 1, pp. 62-76.

Date

2021-01-01

Publisher

Webology Center

Subject

Flash-DBSim; LRU; NAND Flash Memory; Page Replacement Memory

Coverage

Paulson H., Bharathiar University, Coimbatore, Tamilnadu, India, Little Flower College, Guruvayoor, Kerala, India; Rajesh R., Department of Computer Science, CHRIST (Deemed to be University), Bangalore, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 1735188X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.14704/WEB/V18I1/WEB18027

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102794897&doi=10.14704%2fWEB%2fV18I1%2fWEB18027&partnerID=40&md5=8cb2e9d4976af182b5731fa1cfad3552