Dynamic Memory Partitioning

Overview

This project implements three dynamic memory allocation algorithms used in Operating Systems:

• First Fit
• Best Fit
• Worst Fit

The simulator allocates processes to memory blocks and compares the performance of different allocation strategies based on memory utilization and fragmentation.

---

Features

• First Fit Allocation
• Best Fit Allocation
• Worst Fit Allocation
• Memory Utilization Analysis
• External Fragmentation Calculation
• Execution Time Comparison
• Console-based implementation in C

---

Technologies Used

• C Programming
• Operating Systems
• Dynamic Memory Partitioning

---

Sample Input

Memory Blocks: 100 500 200 300 600

Processes: 212 417 112 426

---

Sample Output

First Fit

Best Fit

Worst Fit

How to Run

Compile

gcc memory_allocation.c -o memory

Run

./memory

Windows

memory.exe

---

Learning Outcomes

• Dynamic Memory Allocation
• First Fit Algorithm
• Best Fit Algorithm
• Worst Fit Algorithm
• External Fragmentation
• Memory Utilization

---

Author

Dhakshinya Tulasi B.Tech CSE Sreenidhi Institute of Science and Technology