CPU cache emulator (LRU)
-
Updated
Apr 11, 2015 - C++
CPU cache emulator (LRU)
Direct Mapped and N-Way set associative cache Simulator in C/C++ for L1 cache in Processors
Minimal C++ LRU cache using a linked-list and a map
Implemented modern last-level cache(LLC) with the concept of "Perceptron Learning for Reuse Prediction" that use neural network idea, which is training the predictor by a smaller independent cache with a series of features.
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
Implementing several Page Replacement algorithms used in Operating Systems.
C++ program that implements the FIFO, Optimal, MFU, and LRU page-replacement algorithms. Given a page-reference string, where page numbers range from 0 to 9, apply the page-reference string to each algorithm, and output the number of page faults incurred by each algorithm.
A C++11 simulator for a variety of CDN caching policies.
Replacement Policy implemented in linux. Assigned 5/12/2020, Due 12/12/2020
LRU Stands for Least Recently Used and LRU Cache help identify the least recently used items in a System.
Page replacement simulator - Operating Systems Memory Virtualization project
Algorithms Studied During Operating System Course
🦄 链式哈希 [LRU] Fast, header-only, cross-platform and STL-like linked_hash_map & linked_hash_set for C++. (beats 100% submissions @ leetcode) LRUCache
Derive the optimal cache hit ratio for Internet request traces with variable object sizes.
🍀 c++ standalone header-only basic library. || c++头文件实现无第三方依赖基础库
Add a description, image, and links to the lru topic page so that developers can more easily learn about it.
To associate your repository with the lru topic, visit your repo's landing page and select "manage topics."