Memory management simulator, using Hashed Page Table. Page Replacement Algorithms: Least Recently Used (LRU) and Second Chance.
-
Updated
Apr 12, 2021 - C
Memory management simulator, using Hashed Page Table. Page Replacement Algorithms: Least Recently Used (LRU) and Second Chance.
Memory management project for OS course
Implementation of Least Recently Used (LRU) and Second Chance page replacement in android
Simulator of a Memory Page Management System, focused on process Page Tables & Page Replacement algorithms.
Page replacement algorithms implemented in c language: FIFO, LRU, Optimal, MFU, LFU, Second chance
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
Programa em C que simula o funcionamento do gerenciamento de memória virtual em um sistema operacional.
FIFO,LRU,Second-chance algorithms for handling page faults
Implementação de um simulador de memória virtual, aplicando algoritmos de substituição de página LRU, NRU e Second Chance.
Implementation and comparison of various caching policies, on different type of workloads
Page replacement algorithms for memory management in operating systems
Add a description, image, and links to the second-chance-replacement topic page so that developers can more easily learn about it.
To associate your repository with the second-chance-replacement topic, visit your repo's landing page and select "manage topics."