Page Replacement Methods 1 Submitted By MD Sazid Zamil (213015018) Romn Ahmed Shohag (213015017) Submitted To Mahbubur Rahman Lecturer, Green University of Bangladesh
I n tro d u ct i on Project Objectives Reduce the number of page faults to improve overall system performance. Enhance the overall throughput of the system. Reduce the frequency of disk input/output operations. Ensure fair allocation of memory resources among all processes. Prevent system crashes and thrashing. 2
Project Overview To create an interactive web application that simulates three different page replacement algorithms: FIFO (First-In-First-Out), LRU (Least Recently Used), and Optimal. This application allows users to input parameters and visualize how these algorithms work in managing page faults and hits. 3
Project Design Overview 4
FIFO Algorithm 5 FIFO stands for "First-In, First-Out." It's a way to manage memory in a computer by removing the oldest data first when new data needs to be added. Think of it like a line (queue) at a store where the first person to enter the line is the first one to be served and leave the line.
FIFO Algorithm Code Overview 6
Results of the Project 7 Successfully implemented and simulated three page replacement algorithms: FIFO. Created an interactive web application that allows users to visualize and compare the performance of these algorithms. Generated insights into how each algorithm handles page faults and hits under different scenarios. Demonstrated practical implications for system performance and efficiency based on algorithm selection.
In conclusion, this project has allowed us to explore fundamental page replacement algorithms: FIFO. Through our interactive web application, we've gained insights into how these algorithms manage memory pages and their respective efficiencies in terms of page faults and hits. Conclusion 8