Paging algorithm
Paging algorithm"Paging algorithm" is a way to page out the pages in memory.There are two typical methods.① FIFO(First In First Out)This is a way to page out the oldest page.Suppose there are four empty areas in memory. The memory will be fulledwhen 2, 3, 5 and 8 pages are readed to it. Next, one area in the memory hasto be emptied if the memory try to read 6 page. "Page fault" will occur at thistime and 2 page will be paged out and 6 page will be readed.② LRU(Least Recently Used)This is a way to page out the page whose time most elapses sinceit was last referenced.One area in the memory has to be emptied if the memory try to read 6 page. "Page fault" will occur at this time and 5 page wi
0
