Skip to content

Memory_Manager was a program designed to show how the memory is stored for jobs using the different memory fit algorithms.

License

Notifications You must be signed in to change notification settings

JaredScar/Memory_Manager

Repository files navigation

Memory_Manager

License: MIT

Memory_Manager was a program designed to show how the memory is stored for jobs using the different memory fit algorithms. The program was made for Sister Jane's COM 310 Operating Systems assignment #2.

Assumptions:

  • There is a max of 9 processes.
  • There is a limit to the minimum size of a process based on how much total memory entered(A message will pop up if the entered number is too small).
  • Each process can only be in memory once at a time.
  • There is a minimum size required for each process based on total memory size. When you try and add a process too small a message will pop up providing you with the calculated minimum size. The OS must fit this size requirement too.

Memory Fit Algorithms Included:

First Fit

Every process is added to the first hole it can fit in. If it can not fit in any hole, it will not be added.

Best Fit

Every process is added into the smallest hole it can fit in. If it can not fit in any hole, it will not be added.

Worst Fit

Every process is added into the largest hole it. If it can not fit in any hole, it will not be added.

About

Memory_Manager was a program designed to show how the memory is stored for jobs using the different memory fit algorithms.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published