Real-time performance forensics with eBPF. Correlates CPU usage, scheduler contention and page-fault pressure to detect noisy neighbors & OOM risks.

These are the Python implementations of FIFO, LRU and OPT page replacement algorithms

Kernel module and written report on page faults in a modern Linux system.

Applies various page replacement algorithms to a reference string and displays the number of page faults and where they occurred.

Program that implements the FIFO, Optimal, MFU, and LRU page-replacement algorithms.

Basic paging system, simulating page faults while reading a trace file. LRU and Second chance replacement algorithms can be tested with various parameters.

Reproducible Pascal GPU Unified Memory benchmark with Nsight and nvprof profiling

Page Replacement Algorithm Simulator is a Streamlit-based application that simulates and compares FIFO, LRU, and Optimal algorithms. It displays memory state changes, compares page faults, and provides insights into algorithm performance.

Implementation of Simple and Lazy Loader, which replicates the functioning of the loader of an Operating Systems

Implement an exec-loader in C that handles page faults

Windows terminal performance monitor showing CPU, per-core usage, deep memory (commit/kernel paged/nonpaged), and system counters. Run as admin.

Command to show usage of memory on the whole system and on each process including memory usage, swap, cache and page faults.