Page Replacement Algorithms in Memory Management: a survey
محورهای موضوعی : journal of Artificial Intelligence in Electrical Engineering
سعید تقوی افشرد
1
,
mehdi ayar
2
1 - Computer Engineering Department, Shabestar Branch, Islamic Azad University
2 - Computer Engineering Department, Shabestar Branch, Islamic Azad University
کلید واژه: memory, operating system, page replacement, performance and page faults,
چکیده مقاله :
One of the most important resources in a computer system is memory. Processes cannot run unless their code and data structures are in RAM. Memory management is important and is the most complex task for an operating system. Page replacement policies have been under extensive study over the years. A large number of different page replacement algorithms have been proposed and many of them have been implemented in operating systems and database management systems. The page fault rate has critical criteria for choosing suitable page replacement algorithms. In this paper, we describe algorithms that are widely simulated and utilized in practice. Then, we indicate the effective and efficient algorithm among them.
One of the most important resources in a computer system is memory. Processes cannot run unless their code and data structures are in RAM. Memory management is important and is the most complex task for an operating system. Page replacement policies have been under extensive study over the years. A large number of different page replacement algorithms have been proposed and many of them have been implemented in operating systems and database management systems. The page fault rate has critical criteria for choosing suitable page replacement algorithms. In this paper, we describe algorithms that are widely simulated and utilized in practice. Then, we indicate the effective and efficient algorithm among them.
[1] A. S. Tanenbaum,, Modern Operating Systems, Prentice Hall; Second edition, 2001.
[2] W. Stallings. Operating Systems Internals and Design Principles, Fifth Edition, Prentice Hall, 2004.
[3] E. J. O'Neil, P. E. O'Neil, and G. Weikum, An Optimality Proof of the LRU-K Page Replacement Algorithm, Journal of the ACM, Vol. 46, No. 1, January 1999, pp. 92-112.
[4] S. Chang, K. Zhang, Application Specific Memory Management, Electrical Engineering and Computer Science Department, University of California, Berkeley.
[5] S. H. Abbas, W. A. K. Naser, and L. M. Kadhim, “Study and Comparison of Replacement Algorithms,” Int. J. Eng. Res. Adv. Technol., vol. 08, no. 08, pp. 01–06, 2022, doi: 10.31695/ijerat.2022.8.8.1.
[6] M. Waqar, A. Bilal, A. Malik, and I. Anwar, “Comparative analysis of replacement algorithms techniques regarding to technical aspects,” Eur. J. Eng. Technol., vol. 4, no. 5, pp. 60–82, 2016.
[7] B. A. Tingare and V. L. Kolhe, “Analysis of Various Page Replacement Algorithms in Operating System,” Int. J. Sci. Res., vol. 5, no. 12, pp. 578–584, 2016, [Online]. Available: https://www.ijsr.net/archive/v5i12/ART20163405.pdf.
[8] G. Rexha, E. Elmazi, and I. Tafa, “A Comparison of Three Page Replacement Algorithms: FIFO, LRU and Optimal,” Acad. J. Interdiscip. Stud., vol. 4, no. 2, pp. 56–62, 2015, doi: 10.5901/ajis.2015.v4n2s2p56.
[9] H. M. H. Owda, M. A. Shah, A. I. Musa, and M. I. Tamimy, “A Comparison of Page Replacement Algorithms in Linux Memory Management,” Int. J. Comput. Inf. Technol., vol. 03, no. 03, pp. 565–569, 2014, [Online]. Available: www.ijcit.com565.
[10] R. K. Gupta and M. A. Franklin, “Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison,” IEEE Trans. Comput., vol. c–27, no. 8, pp. 706–712, 1978.
[11] A. J. Smith, “A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory,” IEEE Trans. Softw. Eng., vol. SE-4, no. 2, pp. 121–130, 1978, doi: 10.1109/TSE.1978.231482.
[12] S. Iranit, A. R. Karlin, and S. Phillips, “Strongly Competitive Algorithms for Paging with Locality of Reference,” Soc. Ind. Appl. Math., vol. 25, no. 3, pp. 477–497, 1996, doi: 10.1007/springerreference_65225.
