Research on the Realization of LRU Algorithm

摘要：

This paper analyzes LRU page-replacement algorithms, and points out that LRU is closest to OPT among all possible page-replacement algorithms. It studies the four possible methods for LRU algorithm: measurement of time, count of number, use of registers, and use of stack. Data structures and implementation methods are proposed;approximation algorithms are discussed. This paper also analyzes the performances and reliability of different LRU page-replacement algorithms, providing some basic information for us to choose them in different systems.

关键词： LRU improved page table the Register algorithm Approximation algorithm

作者: Wang hong

作者单位: School of computer and communication engineering WeiFang University WeiFang China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 559-561

在线出版日期: 2011-02-26（万方平台首次上网日期，不代表论文的发表时间）