libalru is a library for creating really fast numeric based LRU caches that leverage an optimized CRC-16-CCITT ported over from @mafintosh's array-lru
-
Updated
Jan 17, 2018 - C
libalru is a library for creating really fast numeric based LRU caches that leverage an optimized CRC-16-CCITT ported over from @mafintosh's array-lru
A C-Program that simulates Virtual Memory Management based on a text file input of logical addresses which represents sequential instructions with address range 0 thru 2^16 - 1. See the Project Report for more details regarding usage.
Simulator for queueing systems and LRU caches
A direct-mapped cache for variable-length arrays with least recently used replacement and static allocation.
Modification of xv6 OS for independent research project at UNLV.
A console application to simulate cache and cache replacement policies : LRU, LFU and MRU
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
Cache Replacement Policies in operating system from scratch
Write through LRU 4 Way Set Associative Cache simulation. The objective is to measure the miss rate of this kind of cache.
Cashed is an LRU based caching service written in plain c.
Important OS Codes and Concepts(Sorted)
Implementation and comparison of various caching policies, on different type of workloads
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."