期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2013
卷号：4
期号：4
页码：683-685
出版社：Technopark Publications
摘要：Now days, page replacement policy become the heart of caching system. Which decides which page to replace in a cache by a new one? Different page replacement algorithms have dramatically different effects on the system performance. A virtual memory system needs efficient page replacement algorithms to decide which pages to evict from memory in case of a page fault. Over the years many algorithms have been proposed for page replacement. Each algorithm attempts to minimize the page fault rate while incurring minimum overhead. , In this paper we discuses at the traditional algorithms such as LRU. Least Recently Used (LRU) page replacement algorithm is most efficient algorithm compare to others algorithms
关键词：Page Replacement; LRU; Demand paging; locality of reference; Reference bit
