Description: functional presentations : 1 P process imported a total of some pages. l and enter the system has been allocated in memory of a few pages. When the distribution of more than a few pages of the process P pages, l l not need pages scheduling work. L P process by the number of pages, l procedures for random number generation to the memory pages, l To simplify procedures, l these pages, with the number of P l process consistent number of processes (the defect has yet to be improved). L chosen by the user FIFO or LRU algorithm algorithm to process P pages allocated to the memory pages for distribution, l and output specific pages course of the visit. Principle introduced : request for the page-style management of replacement algorithm : Replacement Algorithms in memory when no spare pages call.
File list (Check if you may need any files):
Download