Skip to content

One of the key concept we learn in Operating Systems is Paging for virtual memory management. Using page replacement algorithms we decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. This project helps to visually understand how the Page Replacement Techniques work.

Notifications You must be signed in to change notification settings

mohit01-10/Page_Replacement_Algos_Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Page Replacement Algorithm Visualizer

This is a Page Replacement Techniques Visualizer project. The project is built out of python and uses the tkinter module to visualize the way 2 of the most popular Page Replacement algorithms. The algorithms visualized are:

FIFO (First come, First served)

LRU (Least Recently Used)

I built this application because I was fascinated by page replacement algorithms, and I wanted to visualize them in action. Further, when solving problem related to the topics, i often did some mistake in calcultions and it was hard to pin point it.

About

One of the key concept we learn in Operating Systems is Paging for virtual memory management. Using page replacement algorithms we decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. This project helps to visually understand how the Page Replacement Techniques work.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages