Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
-
Updated
Dec 9, 2020 - C
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
Implementation and comparison of various caching policies, on different type of workloads
Template implementation of a dynamically memory allocated linked list cache using the least recently used (LRU) algorithm.
An Efficient File Sharing and centralized data management network file system, enhancing collaboration in multi-user environments.
Cashed is an LRU based caching service written in plain c.
Write through LRU 4 Way Set Associative Cache simulation. The objective is to measure the miss rate of this kind of cache.
An efficient way of LRU and FIFO cache has been implemented.
C implementation for Smart Proxy Server for HTTP and HTTPS based URL filtering.
A direct-mapped cache for variable-length arrays with least recently used replacement and static allocation.
A console application to simulate cache and cache replacement policies : LRU, LFU and MRU
Modification of xv6 OS for independent research project at UNLV.
NFS for users to manage their system storage files and directories
Cache Replacement Policies in operating system from scratch
Add a description, image, and links to the lru-cache topic page so that developers can more easily learn about it.
To associate your repository with the lru-cache topic, visit your repo's landing page and select "manage topics."