Research on the Realization of LRU Algorithm

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

891-894

Citation:

Online since:

February 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Feng HongWei, Wang Peng. Operating system teaching and experimental design research. Laboratory research and exploration, the 26th volume (12 issues): pp.251-253. (2007).

Google Scholar

[2] Wang Hong, Hou Gang and so on, operating system Discipline (Linux) - - exercise explanation, sample question analysis, experimental instruction (the second edition). Beijing: Water conservancy and Hydroelectric Power Press, pp.214-284. August, (2008).

Google Scholar

[3] LusongNian. Operating ystemS Tutorial , BeiJing: Electronic Industry Press, pp.34-36. , 2010. 2.

Google Scholar

[4] Liziqiang. An Improved Page Replacement Algorithm Supporting Realtime Processes Based On Objrmap,. Computer Engineering&Science. PeKing, 10rd ed Vol 29. pp.41-43. (2007).

Google Scholar

[5] Wang Hongbo. LRU—based Algorithm for Identifying andMeasuring Large Flows[J],. Journal of Electronics and Information Technology,10rd. Vol 39. pp.52-55. (2007).

Google Scholar

[6] Jongmoo, Sam H. Noh, Sang Lyul Min, Eun-Yong ha, yookun Cho. design, Implementntation, and Performance Evaluation of a Detection-Based Adaptive Block replacement scheme, IEEE Trans, on computers, Vol. 51, No. 7: 793-795, July (2002).

DOI: 10.1109/tc.2002.1017699

Google Scholar

[7] William Stallings. Operating Systems—Internals and design principles( Fifth edition). April 2006. pp.355-356.

Google Scholar

[8] Bestavros A, Shudong J. Popularity-aware Greedy Dual-size Web Proxy Caching Algorithms[C]. Proc. of the 20th International Conference on Distributed Computing Systems, 2002: 254-261.

DOI: 10.1109/icdcs.2000.840936

Google Scholar