Integrated Cache Scheduling Replacement Algorithm to Reduce Cache Pollution

Cache memory management has recently become one of the most crucial research topics in the area of high performance computing. The cache memory has gained popularity due to its capability to offer faster access compared to main memory so processor can access data directly through cache very efficiently. As processor execution speed is faster than accessing memory so the goal is to keep programs rapidly accessible for processing. Cache memory helps not only to access data quickly but also improves the performance of the system. Various cache management policies have been developed to improve the performance of the system. In this paper we focus the issues related with the existing replacement policies and present a new algorithm to overcome these issues. In this paper, we proposed Integrated Cache Scheduling Replacement Algorithm (ICSRA) that will remove the object on the basis of integration of all the parameters like size, frequency and recency if the cache is full. This algorithm consider all size of object to replace with the condition of frequency and timestamp parameter to reduce the cache pollution [1]. Cache pollution means the cache unnecessary waste its space by holding such an object which is no longer be accessed. ICSRA helps to enhance the utilization of cache memory in an efficient manner as well as maximize the cache hit ratio to improve the performance of the system. A detailed classification has also been included based on different parameters which are depending on the analysis of the existing techniques.