Comparative Analysis of FIFO and LRU Memory Management Algorithms Using CPU-OS Simulator v7.5.50
Kajian Komparatif terhadap Algoritma Manajemen Memori FIFO dan LRU Menggunakan CPU-OS Simulator v7.5.50
Keywords:
cpu-os simulator v7.5.50, memory management, first-in-first-out (fifo), least recently used (lru), page fault rateAbstract
Efficient memory management is a critical aspect of operating system performance, as poor management can lead to high page fault rates, increased execution time, and reduced CPU utilization. This study examines the performance comparison of two widely used memory management strategies, First-In-First-Out (FIFO) and Least Recently Used (LRU), using simulations conducted through the CPU-OS Simulator v7.5.50. The objective is to observe differences in page fault rate, execution time, and CPU efficiency across various scenarios. Three experiments were conducted: first, the impact of cache/pipeline configuration; second, the influence of process scheduling on memory management; and third, the effect of memory size and page access patterns. The results show that LRU tends to provide a lower page fault rate under heavy workloads, while FIFO demonstrates advantages when memory is limited and overhead is minimal. This study contributes to understanding how page replacement algorithms affect system performance in an operating system simulation environment.
References
Abbas, S. H., Naser, W. A., & Kadhim, L. M. (2022). Study and comparison of replacement algorithms. International Journal of Engineering Research and Advanced Technology (IJERAT), 8(8), 1-6. https://doi.org/10.31695/IJERAT.2022.8.8.1
Bengar, A. (2025). Priority cache object replacement by using LRU, LFU and FIFO algorithms to improve cache memory hit ratio. Transactions on Soft Computing, 1(1), 1-13. https://doi.org/10.48314/tsc.v1i1.33
Demin, A., Dorn, Y., Katrutsa, A., Kazantsev, D., Latypov, I., Maximlyuk, Y., & Ponomaryov, D. (2024). EEvA: Fast expert-based algorithms for buffer page replacement. CoRR, abs/2405.00154.
Thakkar, B., & Padhy, R. N. (2024). Comparative analysis of page replacement algorithms in operating system. Journal of Emerging Technologies and Innovative Research, 11(5).
Titarenko, L., Kharchenko, V., Puidenko, V., Perepelitsyn, A., & Barkalov, A. (2024). Hardware-based implementation of algorithms for data replacement in cache memory of processor cores. Computers, 13(7), 166. https://doi.org/10.3390/computers13070166
Belady, L. A. (1966). A study of replacement algorithms for virtual-storage computers. IBM Systems Journal, 5(2), 78–101.
https://doi.org/10.1147/sj.52.007
Denning, P. J. (1968). The working set model for program behavior. Communications of the ACM, 11(5), 323–333.
https://doi.org/10.1145/363095.363141
Silberschatz, A., Ganapathi, A., & Sharma, V. (2018). Analysis of memory management techniques in modern operating systems. ACM Computing Surveys, 50(4), 1–36.
https://doi.org/10.1145/3129288
Zhang, Y., Chen, X., & Li, K. (2021). An efficient page replacement algorithm based on access frequency and recency. Journal of Systems Architecture, 117, 102118.
https://doi.org/10.1016/j.sysarc.2021.102118
Alsaedi, A., & Awan, I. (2019). Performance evaluation of page replacement algorithms in virtual memory systems. International Journal of Computer Applications, 181(44), 14–20.
