A Java program that simulates various memory allocation strategies, including First Fit, Best Fit, and Worst Fit.
-
Updated
Sep 22, 2024 - Java
A Java program that simulates various memory allocation strategies, including First Fit, Best Fit, and Worst Fit.
A console based simulation for memory allocation techniques(First Fit,Best Fit,Worst Fit). Also some additional features like memory compaction,memory release and availability of empty spaces in ram.
Operating Systems Lab Programs
Libft 42 Project, a C library designed to achieve different tasks with several functions of C.
Reimplementing malloc(), calloc(), realloc(), free() in c from scratch using system calls
Get Next Line is a project at 42 network (1337 school). It is a function that reads a file and allows you to read a line ending with a newline character from a file descriptor. When you call the function again on the same file, it grabs the next line
Projects 1-6 from CMSC216 Fall 2022
Implemented system calls for no of total processes, process info like id, size, count of context switches, SJF scheduling algorithm and tested it for CPU and I/O bound tasks. Resolving page fault via lazy memory allocation. Incorporated features like creating a kernel process for paging, swap in, swap out mechanisms, and writing sanity tests.
Console app to simulate next fit algorithm used on UNIX memory allocation. Written in C++.
BIL 200 Lecture Project
Add a description, image, and links to the memoryallocation topic page so that developers can more easily learn about it.
To associate your repository with the memoryallocation topic, visit your repo's landing page and select "manage topics."