lru页面替换算法
Here you will get program for lru page replacement algorithm in C.
在这里,您将获得C语言中的lru页面替换算法的程序。
Least Recently Used (LRU) page replacement algorithm works on the concept that the pages that are heavily used in previous instructions are likely to be used heavily in next instructions. And the page that are used very less are likely to be used less in future. Whenever a page fault occurs, the page that is least recently used is removed from the memory frames. Page fault occurs when a referenced page in not found in the memory frames.
最近最少使用(LRU)页面替换算法的工作原理是,先前指令中大量使用的页面很可能在下一指令中大量使用。 而且,很少使用的页面将来可能会更少使用。 每当发生页面错误时,都会从内存帧中删除最近使用最少的页面。 当在存储框架中找不到引用的页面时,将发生页面错误。
Also Read: