Integrated Cache Scheduling Replacement Algorithm to Reduce Cache Pollution
Kavita Kalambe1, Sunita Rawat2, Nilesh Korde3, Gaurav Kawade4 

1Kavita Kalambe, Assistant Professor, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.
2Sunita Rawat. Assistant Professor, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.
3Nilesh Korde. Assistant Professor, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.
4Gaurav Kawade, Assistant Professor, Department ofComputer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.

Manuscript received on 12 March 2019 | Revised Manuscript received on 16 March 2019 | Manuscript published on 30 July 2019 | PP: 3471-3475 | Volume-8 Issue-2, July 2019 | Retrieval Number: B2868078219/19©BEIESP | DOI: 10.35940/ijrte.B2868.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: 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.
Index Terms: Cache Memory, Cache hit Ratio, Cache Pollution, Cache Replacement Algorithm, ICSR.

Scope of the Article:
Social Sciences