Novel simulation of computer memory management

This research paper provides a novel simulation of some basic memory management techniques using the C programming language. The paper evaluates the above techniques as four distinct modules namely process scheduling algorithms, deadlock handling, paging implementation, page replacement algorithms and client-server implementation. The first module process scheduling implements and compares four algorithms namely-FCFS, SJF, Priority based and Round Robin. The second module deadlock handling includes algorithm for deadlock detection and avoidance. The third module paging implements basic paging technique followed by MVT and MFT. The fourth module being page replacement algorithms includes implementation and comparison of two algorithms-LRU and Optimal page replacement technique. Lastly we delve to the client server implementation of process scheduling which in future can be implemented as a platform independent job scheduling software for an enterprise.