Replacement Policy Performance Analysis LRU Insertion Policy (LIP) on X86 Computer Architecture
Oka Samdya Adabi, Hilal H. Nuha, Febri Dawani, Demi Adidrana, Rana Zaini Fathiyana, Hassan Rizky Putra Sailellah · 2024
The x86 architecture has been widely used in various modern computing devices, including processors such as Alder Lake. Along with the increasing computing needs, a deep understanding of the performance of computer architecture becomes important, especially in memory management. This study focuses on analyzing the performance of x86 architecture by examining memory replacement policies, especially the LRU Insertion Policy (LIP). LIP is an algorithm that places new data in the Least Used (LRU) position in the cache, aiming to reduce cache misses and protect the cache from thrashing, especially for applications with high memory requirements. This study simulates and compares LIP with the traditional LRU policy at various cache levels (Ll, L2, L3). The results show that LIP can reduce cache misses in high-level caches such as L2 and L3, although with the trade-off of increasing cache replacements. Therefore, the selection of memory replacement policies must consider the cache hierarchy and specific workloads.