Discrete Flow Matching implemented in PyTorch
-
Updated
Mar 23, 2025 - Python
Discrete Flow Matching implemented in PyTorch
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.
Program that implements the FIFO, Optimal, MFU, and LRU page-replacement algorithms.
This Repo contains basic modules like Use of Kernel level Libraries, Random Number generation, Heap Memory Module implementation via best-fit,first-fit,Buddy Systems,Virtual Memory Mechanisms FIFO,LFU,MFU, Process deadlock Mechanism Detection
A smart caching system that combines traditional strategies (LRU, LFU, MFU) with machine learning to approximate Belady’s optimal replacement policy. This project generates skewed access patterns, labels them using optimal logic, trains multiple ML models, and integrates the best into a custom predictive cache.
Add a description, image, and links to the mfu topic page so that developers can more easily learn about it.
To associate your repository with the mfu topic, visit your repo's landing page and select "manage topics."