Methodology - dverenna/osproj2 GitHub Wiki

We chose First-Fit for our memory management strategy. We chose to use this strategy because it is the fastest strategy because it searches for the first available memory block which would fit the process that is attempting to be scheduled. We have a double linked list that represents memory and we traverse the double linked list looking for two nodes whose difference from start to end is greater than the memory requirements of the process attempting to be scheduled.