LRU Page Replacement Algorithm using OpenGL


LRU Page Replacement Algorithm Mini Project Implemented in C++ using OpenGL – 18CSL67

Download the source code of LRU Page Replacement Algorithm Computer Graphics mini Project in OpenGL for computer graphics and Visualization laboratory with mini-project – 18CSL67.

Problem Statement:

In this project, we created a Graphics animation to demonstrate LRU Page Replacement Algorithm. A good approximation to the optimal algorithm is based on the observation that pages that have been heavily used in the last few instructions will probably be heavily used again in the next few. Conversely, pages that have not been used for ages will probably remain unused for a long time. This idea suggests a realizable algorithm: when a page fault occurs, throw out the page that has been unused for the longest time. This strategy is called LRU (Least Recently Used) paging.

User Requirements

  • Easy to understand and should be simple.
  • The built-in functions should be utilized to the maximum extent.
  • OpenGL library facilities should be used.

Hardware Requirements

  • Intel Pentium CPU 2.6 GHz or AMD Athlon 64 (K8) 2.6 GHz or higher
  • 1 GB RAM or more
  • Mouse
  • Keyboard 108 standard
  • Monitor resolution 800×600

Software Requirements:

  • Programming Language: C / C++ Using OpenGL
  • Operating System: Windows / Linux
  • Compiler: C / C++ Compiler (GCC)
  • IDE: Code Blocks
  • Functional Requirements: GLUT

Books referred:

Edward Angel: Interactive Computer Graphics A Top-Down Approach with OpenGL, 5th Edition, Pearson Education, 2008.

Computer graphics with OpenGL Book by Donald Hearn and M. Pauline Baker.

Screenshots of LRU Page Replacement Algorithm Computer Graphics mini Project in OpenGL – 18CSL67

LRU Home Screen
LRU with one page
LRU Last Screen

Leave a Comment

Your email address will not be published. Required fields are marked *