Memory Management Simulation

Please send email to [email protected] if you want to have the source code to further research.

This simulation is built in order to simulate the effectiveness of 3 type of memory management algorithm using in our OS in the "ancient" time. The first type is: "The first-fit algorithm." (Please refer to your OS textbook to know in detail.). The second type is: "Best fit algorithm". The third algorithm simulated in this system is Best First Fit algorithm which the author produced it by combining the advantages from the previous 2 algorithms. The simulation was implemented with a time unit where each randomly generated job has a certain size and time unit needed to remain in memory.

In this simulation, several pre-defined sizes of memory segments were created initially. Each memory segment will have different memory blocks in size. Different algorithms will have the different mechanism in choosing which memory segment to load the generated jobs in order to minimize the wasted memory blocks and have the most jobs loaded into memory at the same time. In other words, there will be a minimum number of jobs waiting in the queue to be loaded. This is one of the best simulators has been built in DOS mode using C by the author. You perhaps can have a try and run the program in full-screen DOS mode.