A Heuristic-based Cache Replacement Policy for Data Caching
Caching frequently accessed data is an important technique that allows performance improvement of a system by providing reusability of data in wired and wireless data dissemination environments.Also caching is a major step in system designing to achieve high performance in areas like WWW,operating systems,databases and LDIS of wireless environments.In this paper,we propose a cache replacement policy called H-CRP,that allows clients in wired and wireless environment to perform extremely well when compared to other existing replacement policies.The novel cache replacement algorithm takes into account the parameters like frequency of access associated with data item,retrieval delay associated with accessing page and size of data for selection of eviction page that can affect cache performance whose direct impact is on cache validation cost.In case of pages with same size,randomized selection of the page for replacement is done based on heuristic value.These heuristics make the H-CRP perform better than the existing strategies of LRU,S-LRU as indicated by the simulation results.A comprehensive comparison made among LRU,S-LRU,H-CRP shows that the H-CRP significantly reduces the number of cache misses by improving the cache hit ratio compared to the other two algorithms.
Location dependent Information Services (LDIS) World Wide Web (WWW) Cache Management System (CMS) Least Frequently Used(LFU) Least Recently Used(LRU) Segmented-LRU(S-LRU) Heuristic-Cache Replacement Policy (HCRP)
Kahkashan Tabassum Asia Sultana Dr.A.Damodaram
Associate Professor,CSED M.J.C.E.T.,Banjara Hills Hyderabad-500155,India Assistant Professor,ITD M.J.C.E.T.,Banjara Hills Hyderabad-500155,India Professor,CSED J.N.T.U.,Kukatpally Hyderabad - 500 085,India
国际会议
秦皇岛
英文
464-467
2010-11-05（万方平台首次上网日期，不代表论文的发表时间）