Journal of Engineering and Applied Sciences

Year: 2018
Volume: 13
Issue: 2
Page No. 478 - 483

A Novel Approach to Improve LRU Page Replacement Algorithm

Authors : Nabeel Zanoon, Evon Abu-Taieh and Hatem Salem Abu-Hamatta

References

Anthony, R., 2015. Systems Programming: Designing and Developing Distributed Applications. Elsevier, Amsterdam, Netherlands, ISBN:9780128008171, Pages: 548.

Bagchi, S. and M. Nygaard, 2004. A Fuzzy Adaptive Algorithm for Fine Grained Cache Paging. In: Software and Compilers for Embedded Systems, Schepers, H. (Ed.). Springer, Berlin, Germany, ISBN:978-3-540-23035-9, pp: 200-213.

Bansal, S. and D.S. Modha, 2004. CAR: Clock with adaptive replacement. Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST’04) Vol. 4, March 31, 2004, USENIX Association, San Francisco, California, pp: 187-200.

Bennett, B.T. and V.J. Kruskal, 1975. LRU stack processing. IBM. J. Res. Dev., 19: 353-357.
CrossRef  |  Direct Link  |  

Brinkhoff, T., 2002. A Robust and Self-Tuning Page-Replacement Strategy for Spatial Database Systems. In: Advances in Database Technology, Jensen, C.S., S. Saltenis, K.G. Jeffery, J. Pokorny and E. Bertino et al. (Eds.). Springer, Berlin, Germany, ISBN:978-3-540-43324-8, pp: 241-276.

ChengJun, W., 2009. The research on the dynamic paging algorithm based on working set. Proceedings of the 2nd International Conference on Future Information Technology and Management Engineering (FITME'09), December 13-14, 2009, IEEE, Sanya, China, ISBN:978-1-4244-5339-9, pp: 396-399.

Coras, F., A. Cabellos-Aparicio and J. Domingo-Pascual, 2012. An Analytical Model for the LISP Cache Size. In: Networking, Bestak, R., L. Kencl, L.E. Li, J. Widmer and H. Yin (Eds.). Springer, Berlin, Germany, ISBN:978-3-642-30044-8, pp: 409-420.

Dorrigiv, R., M.R. Ehmsen and A. Lopez-Ortiz, 2015. Parameterized analysis of paging and list update algorithms. Algorithmica, 71: 330-353.
Direct Link  |  

Garrido, J.M. and R. Schlesinger, 2008. Principles of Modern Operating Systems. Jones & Bartlett Learning, Burlington, Massachusetts, USA., ISBN-13:978-0-7637-3574-6, Pages: 489.

Hwang, K. and N. Jotwani, 2011. Advanced Computer Architecture, 3e. McGraw-Hill Education, New York, USA., ISBN:9789339220938, Pages: 723.

Jiang, S. and X. Zhang, 2005. Token-ordered LRU: An effective page replacement policy and its implementation in Linux systems. Perform. Eval., 60: 5-29.
Direct Link  |  

Juurlink, B., 2004. Approximating the optimal replacement algorithm. Proceedings of the 1st Conference on Computing Frontiers, April 14-16, 2004, ACM, Ischia, Italy, ISBN:1-58113-741-9, pp: 313-319.

Kavar, C.C. and S.S. Parmar, 2013. Improve the performance of LRU page replacement algorithm using augmentation of data structure. Proceedings of the 4th International Conference on Computing, Communications and Networking Technologies (ICCCNT’13), July 4-6, 2013, IEEE, Tiruchengode, India, ISBN:978-1-4799-3926-8, pp: 1-5.

Khulbe, P., S. Kumar and N. Yadav, 2014. An assessment of hybrid LRU (H-LRU) with existing page replacement algorithms. Intl. J. Comput. Appl., 99: 51-53.
Direct Link  |  

O'neil, E.J., P.E. O'Neil and G. Weikum, 1999. An optimality proof of the LRU-K page replacement algorithm. J. ACM., 46: 92-112.
CrossRef  |  Direct Link  |  

O'neil, E.J., P.E. O'neil and G. Weikum, 1993. The LRU-K page replacement algorithm for database disk buffering. ACM. Sigmod Rec., 22: 297-306.
CrossRef  |  Direct Link  |  

Paajanen, H., 2007. Page replacement in operating system memory management. Master’s Thesis, University of Jyvaskyla, Jyvaskyla, Finland.

Rashidah, A., C.L. Gan and M.Y. Rubiah, 2011. Recovery of Memory Based on Page Replacement Algorithms. In: Informatics Engineering and Information Science, Abd-Manaf, A., A. Zeki, M. Zamani, S. Chuprat and E. El-Qawasmeh, (Eds.). Springer, Berlin, Germany, ISBN:978-3-642-25452-9, pp: 499-511.

Reddy, C.M.K., 2009. Operating Systems Made Easy. University Science Press, New Delhi, India, ISBN:978-81-318-0743-9, Pages: 103.

Shen, X., Y. Zhong and C. Ding, 2004. Locality phase prediction. ACM. Sigplan Not., 39: 165-176.
CrossRef  |  Direct Link  |  

Tanenbaum, A.S. and H. Bos, 2014. Modern Operating Systems. 4th Edn., Prentice Hall, Upper Saddle River, New Jersey, USA., ISBN:9780133591620, Pages: 1101.

Wang, H., 2014. Study of page replacement algorithm based on experiment. Appl. Mech. Mater., 530: 895-898.
Direct Link  |  

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved