Search
2 articles for “page replacement algorithms”
-
Evaluation of Write Sequence Reordering Based Buffer Replacement Algorithms for Flash Memory Based Systems
Abstract: Many page replacement algorithms have been developed for disk-based systems. All of them consider the hit rate as a key performance measure. Flash memory has different characteristics than hard disks, such as asymmetric I/O latency among read, write, and erase operations. The read operation is faster than the write and erase operation, and it does not support in-place updates. Besides, write operations shorten the life of flash memories. Therefore, the …
Published in Journal of Computer Technology & Applications · Vol. 14, Issue 2, 2023 · pp. 36–45 Read article
-
Application of B-trees for Design of Optimal Page Replacement Technique in Modern Operating Systems
Abstract: Algorithms related to replacing the memory pages in operating systems are critical components of modern operating systems that manage virtual memory efficiently. Current algorithms such as LRU (Least Recently Used), Clock algorithms as well as FIFO (First-In-First-Out), often struggle with the increasing demands of contemporary applications and larger memory hierarchies. This research work proposes a novel approach utilizing B-tree data structures to design an optimal page replacement technique. The proposed …
Published in International Journal of Data Structure Studies · Vol. 3, Issue 2, 2025 · pp. 23–30 Read article