Priority Cache Object Replacement by Using LRU, LFU and FIFO algorithms to Improve Cache Memory Hit Ratio

Due to the increasing performance between CPU and cache memory, the use of replacement algorithms is very important in various aspects of high-performance computing environments such as e-commerce systems, cache memory management in microprocessors, object management in operating systems, and iteration strategies in information distribution systems and etc. Database server cache performance is an important issue in e-commerce systems. Managing the entry and exit of cache objects with replacement algorithms can reduce the workload of the database server and improve server performance. The algorithms determine which objects remain in the cache memory and which ones go out to make room for new objects. In this way, the algorithms not only decrease user access time, but also enhance the performance of the system. Most of these algorithms are developed by the famous LRU and LFU schemes and can fix their flaws; but unlike them, they are difficult to implement. This research proposes a priority object replacement algorithm that is easy to implement. The algorithm, called PCORA, is based on prioritizing cache memory objects according to three parameters. Experiments show that the proposed algorithm has a better hit ratio than other algorithms and can effectively improve cache memory performance.

کلیدواژه ها:

Operating systems ، cache memory management ، e-commerce systems ، replacement algorithms ، hit ratio ، performance