Page replacement algorithms in c

Page replacement algorithms 

Page replacement algorithms decide which memory pages to page out (swap out, write to disk) when a page of memory needs to be allocated. Paging happens when a page fault occurs and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.

·        First in First Out Page replacement algorithm 

·         Least Recently Used Page in Algorithm


·          Optimal Page Replacement Algorithm



click on links for algorithms in c


Comments