Operating Systems algorithms
-
Updated
Oct 14, 2018 - C++
Operating Systems algorithms
Replacement Policy implemented in linux. Assigned 5/12/2020, Due 12/12/2020
OS Sessional of BUET CSE Dept
Implementation of Optimal, FIFO, LRU, and Clock page replacement algorithms.
Virtual simulation of an operating system with robust features such as input spooling, output spooling, paging and error handling, making it capable of handling multiple jobs simultaneously using C/C++ and GCC compiler
A virtual Paging System I wrote for an assignment in COMP 3500 (Operating Systems)
Not Another Completely Heuristic Operating System (NACHOS)
It is required to simulate some of paging replacement algorithms. The required algorithms to be implemented are as follows: • First In First Out (FIFO) • Least Recently Used (LRU) • Clock
Page replacement algorithms for memory management in operating systems
Minimal Operating System for Student Purpose
C++ virtual-array implementation that uses all graphics cards in system as storage (with LRU cache eviction on RAM) and uses OpenCL for data transfers. (Random access: faster than HDD) (Sequential access: faster than SSD) (big objects: faster than NVMe)
Year-2 Module taken in NTU that focuses on understanding how an Operating System works
IDA Pro plugin module for NES ROMs, simulates bank switching/paging
Add a description, image, and links to the paging topic page so that developers can more easily learn about it.
To associate your repository with the paging topic, visit your repo's landing page and select "manage topics."