This project simulates contiguous memory allocation by utilizing algorithms such as next-fit, first-fit, and best-fit to place incoming processes into memory. Defragmentation may occur in these simulations. Additionally, it utilizes non-contiguous memory allocation as another management algorithm. These simulations use the first-fit approach and page tables to place memory chunks.
-
Notifications
You must be signed in to change notification settings - Fork 0
ariema/Contiguous-and-Non-Contiguous-Memory-Management
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published