Process mayagement in a paging macmie

In a Paged Virtual Memory system, scheduling and multi programming control must consider factors such as the page management policy, system resource utilization and page thrashing. This paper investigates algorithms for managing processes and controlling their entry into the multiprogramming set in a virtual memory environment. The algorithms deal with such things as process de activation, reactivation and transitions between different states of a process in order to dynamically control the degree of multiprogramming and system thrashing. Several algorithms are proposed and evaluated for process activation and deactivation. A seemingly better combination of algorithms is determined based upon several system overhead items, CPU utilization, page faults, space-time product utilization, algorithm efficiency and degree of multiprogramming.