https://github.com/mehul2205/memoryallocation
The real challenge of efficiently managing memory is seen in the case of a system which has multiple processes running at the same time. Since primary memory can be space-multiplexed, the memory manager can allocate a portion of primary memory to each process for its own use. However, the memory manager must keep track of which processes are running in which memory locations, and it must also determine how to allocate and deallocate available memory when new processes are created and when old processes complete execution. While various different strategies are used to allocate space to processes competing for memory, three of the most popular are Best fit, Worst fit, and First fit.
https://github.com/mehul2205/memoryallocation
best-first-search best-fit c-plus-plus first-fit memory-allocation memory-management worst-fit
Last synced: 3 months ago
JSON representation
The real challenge of efficiently managing memory is seen in the case of a system which has multiple processes running at the same time. Since primary memory can be space-multiplexed, the memory manager can allocate a portion of primary memory to each process for its own use. However, the memory manager must keep track of which processes are running in which memory locations, and it must also determine how to allocate and deallocate available memory when new processes are created and when old processes complete execution. While various different strategies are used to allocate space to processes competing for memory, three of the most popular are Best fit, Worst fit, and First fit.
- Host: GitHub
- URL: https://github.com/mehul2205/memoryallocation
- Owner: Mehul2205
- Created: 2019-05-20T17:50:55.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2019-05-20T18:24:00.000Z (about 6 years ago)
- Last Synced: 2025-02-11T12:24:01.230Z (5 months ago)
- Topics: best-first-search, best-fit, c-plus-plus, first-fit, memory-allocation, memory-management, worst-fit
- Language: C++
- Size: 9.77 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0