Page Replacement Algorithms

Submitted in fulfilment of the requirements of

micro-project

Advance Computer Networking

By

“Gaurangi Madankar”
“Aarya Nalage”
“Bhumika Kumari”

ROLL NO:- 55
56
57

ENROLLMENT NO:- 2209640228

2209640229
2209640230

SUBJECT INCHARGE

Mrs. Rachita Mandgilwar

Computer Engineering Department

Academic Year 2024-2025

 CERTIFICATE
This is to certify that the microproject

“Page Replacement Algorithms”

is done by

“Gaurangi Madankar”
“Aarya Nalage”
“Bhumika Kumari”

is submitted for

“Operating Systems”

for

the diploma in Computer Engineering to the

Maharashtra State Board of Technical Education, Mumbai (Autonomous)

(ISO-9001-2008) (ISO/IEC 27001:2013)

____________________________ ______________________________

Subject Incharge Head of Department

(Mrs. Rachita Mandgilwar) (Mrs.Smita Kuldiwar)
 Page Replacement Algorithms
Submitted in fulfilment of the requirements
of micro-project

Advance Computer Networking

By

Process and Individual

Roll Name Enrolment product assessment Presentation/work Total (10)
No No (6 Marks) (4 marks)

GAURANGI 2209640228
55 MADANKAR

AARYA 2209640229
56
NALAGE

BHUMIKA 2209640230
57
KUMARI

SUBJECT INCHARGE

Mrs. Rachita Mandgilwar

Computer Engineering Department

Academic Year 2024-2025

 COMPUTER ENGINEERING DEPARTMENT

VISION AND MISSION OF THE PROGRAMME

Vision: -

To provide technically competent and skilled diploma computer

engineers to fulfil the needs of industry and society.

Mission: -

M1: - To provide industry-oriented quality education and training.

M2: - To impart and inculcate theoretical and practical knowledge.

M3: - To provide interpersonal skills and social ethics.

 COMPUTER ENGINEERING DEPARTMENT

PROGRAMME OUTCOMES

PO1: Basic and Discipline specific knowledge: Apply knowledge of basic

mathematics, science and engineering fundamentals and engineering specialization to
solve the engineering problems.

PO2: Problem analysis: Identify and analyse well-defined engineering problems

using codified standard methods.

PO3: Design/ Development of solutions: Design solutions for well-defined

technical problems and assist with the design of systems components or processes to
meet specified needs.

PO4: Engineering Tools, Experimentation and Testing: Apply modern

engineering tools and appropriate technique to conduct standard tests and
measurements.

PO5: Engineering practices for society, sustainability and environment:

Apply appropriate technology in context of society, sustainability, environment and
ethical practices

PO6: Project Management: Use engineering management principles individually, as

a team member or a leader to manage projects and effectively communicate about
well-defined engineering activities.

PO7: Life-long learning: Ability to analyse individual needs and engage in updating
in the context of technological changes
 COMPUTER ENGINEERING DEPARTMENT

PROGRAMME EDUCATIONAL OBJECTIVES

PEO1: Provide socially responsible, environment friendly solutions

to Computer engineering related broad-based problems adapting
professional ethics.

PEO2: Adapt state-of-the-art Computer engineering broad-based

technologies to work in multidisciplinary work environments.

PEO3: Solve broad-based problems individually and as a team

member communicating effectively in the world of work.

PROGRAMME SPECIFIC OUTCOMES

PSO1: Computer Software and Hardware Usage: Use state-of-the-

art technologies for operation and application of computer software
and hardware.

PSO2: Computer Engineering Maintenance: Maintain computer

engineering related software and hardware systems.
 Page Replacement Algorithms
Aim

The project aims to analyze Page Replacement Algorithms like FIFO, LRU, and Optimal
Page Replacement in Operating Systems to improve memory management and system
performance.

Course Outcomes

o Understanding VPN Architecture and Protocols.

o VPN Use Cases and Applications.
o Analysis of Security and Performance Implications of VPNs.

Proposed Methodology
o First, Search the topic for which you want to make a project, and then propose it to
the Subject In charge.
o After finalizing the topic, start gathering the information about your project.
o Now, it’s time to make a report of your Selected Project.

Action Plan

Sr. Detail of activity Plan Start Date Plan Finish Date

No.

1. Searching of Topic 01-09-2024 03-09-2024

2. Gathering information 14-09-2024 22-09-2024

3. Report Making 4-10-2024 5-10-2024

Subject In-charge
(Mrs. Rachita Mandgilwar)
 Page Replacement Algorithms
Rationale

This microproject explores page replacement algorithms in operating systems, such as FIFO,
LRU, and Optimal Page Replacement. It aims to provide students with insights into the trade-
offs and efficiencies of these algorithms, enabling them to design effective memory
management strategies in real-world applications. The project also enhances their analytical
and problem-solving skills by evaluating each algorithm's advantages and limitations.

Literature

Introduction

In Operating Systems, managing memory efficiently is crucial to improve system

performance. One common challenge is deciding which memory pages to remove or retain
when the system faces limited memory capacity. This is where *Page Replacement
Algorithms* play a significant role. These algorithms are used in virtual memory systems to
manage page allocation, ensuring that the operating system can keep the most frequently used
or relevant pages in physical memory while swapping out less important ones.

Purpose

The primary purpose of page replacement algorithms is to minimize page faults, where a
required page is not in memory and must be loaded from the disk. Effective algorithms help
in maintaining a balance between memory usage and processor efficiency, thus enhancing
system responsiveness.

Types of Page Replacement Algorithms

1. First-In-First-Out (FIFO): This algorithm removes the oldest page from memory to
make space for a new one. While simple, FIFO may not always be the most efficient, as older
pages might still be frequently accessed.

Fault Fault Fault Hit Fault Fault Fault

2. Least Recently Used (LRU): LRU tracks page usage over time and removes the page that
has not been used for the longest period. This method is more efficient than FIFO in many
cases but requires additional data to keep track of page usage history.

Fault Fault Fault Fault Hit Fault Hit Fault Hit Hit Hit Hit Hit Hit

3. Optimal Page Replacement: The optimal algorithm removes the page that will not be
used for the longest time in the future. Although it provides the best possible results in theory,
it is impractical in real-world scenarios because future page requests are unknown.

Fault Fault Fault Fault Hit Fault Hit Fault Hit Hit Hit Hit Hit Hit
4. Clock Algorithm (Second Chance): A practical variation of FIFO, this algorithm gives
each page a second chance before being removed. Pages are stored in a circular list, with a
pointer marking the oldest page. If a page is accessed, it is given a "second chance" before it
is removed.

Fault Fault Fault Fault Hit Fault Fault Fault Hit Fault Fault Fault Fault Fault

Practical Applications

Page replacement algorithms are crucial in systems with limited physical memory. They are
widely used in:
- Computer Operating Systems (Windows, Linux, etc.)
- Real-Time Embedded Systems
- Databases and High-Performance Computing Environments

Conclusion

Page Replacement Algorithms are essential in the design and performance optimization of
operating systems. Understanding various algorithms helps in choosing the right method for a
given environment, balancing efficiency, and speed. This microproject offers a foundational
overview of these algorithms, their benefits, and their limitations, equipping students with
practical knowledge applicable to memory management in real-world systems.

References

- Silberschatz, Galvin, Gagne, "Operating System Concepts"

- Tanenbaum, "Modern Operating Systems"
Actual Methodology Followed

Topi Work Done Data Work Done By

c

1. Searching of topic (Case Study on VPN – Virtual Gaurangi Madankar

Private Network)

2. Gathering of (Rationale, Aim, Applications, etc.) Gaurangi Madankar

Information Aarya Nalage
Bhumika Kumari

3. Report Making Finalization of report Gaurangi Madankar

Resources Required

Sr. Name of Specification Qty. Remark

No Resources
.

1. Computer Intel i3, 4GB RAM or 1 -

above

2. MS-Word Office 2007 or above 1 -

Skill Developed

1. Technical Understanding and Application of VPN Concepts.

2. Research and Analytical Skills.
3. Problem-Solving and Critical Thinking.

Applications

1. Network Security and Privacy.

2. Remote Access and Enterprise Connectivity.
3. VPN Performance and QoS (Quality of Service).

Subject In-charge
(Mrs. Rachita Mandgilwar)