Git repository moved to https://gitlab.com/xanmod/linux
-
Updated
Oct 25, 2024 - C
Git repository moved to https://gitlab.com/xanmod/linux
This project focuses on simulating a multi-tier storage system🔺, with an emphasis on data management📂🔄 through the implementation of various placement policies 🔺⬆️⬇️ . The goal is to analyze the performance and efficiency of different data placement and eviction strategies📊⚡🚀 .
A project for Advanced Operating System(CS604) that implements ARC cache replacement policy.
SPPU Computer Engineering Codes - SPOS (System Programming and Operating System Programs)
This is an implementation of the Least Recently Used (LRU) page replacement algorithm.
一个基于Java实现的操作系统原理演示代码,包含了进程调度、内存管理等操作系统基本功能。
A web-based page replacement simulator that visualizes algorithms like FIFO, LRU, and Optimal, with interactive step-by-step animations, highlighting page faults and hits
Assignment files used for OS Lab UE18CS305
LRU (Least Recently Used ) Cache implementation using Doubly Linked List and Unordered Map
Cache Replacement Policies in operating system from scratch
A simulation of the operations of page tables and page replacement.
23-2 / 컴퓨터구조개론 / 조형민 prof.
Simulator of a Memory Page Management System, focused on process Page Tables & Page Replacement algorithms.
Implementation of Optimal, FIFO, LRU, and Clock page replacement algorithms.
python script to simulate lru replacement algorithm, probably with bug.. but seems to be working
Least recently used (LRU) in-memory cache.
This repository contains all the source code that I have written for my Operating System course.
A LRU cache implemented using object oriented approach
23-2 컴퓨터구조개론 (prof. 조형민)
Add a description, image, and links to the lru-replacement-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the lru-replacement-algorithm topic, visit your repo's landing page and select "manage topics."