A Cache Management Algorithm Based on Page Miss Cost

Based on summary of existing hard disk cache management algorithms and characteristics of hard disk performance, a page miss cost (PMC) cache management algorithm has been proposed. Most of cache management algorithms focus on maximize hit rate. Our analysis shows that cache miss results in tremendous time cost. To minimize the time consumption when a cache miss occurs is the aim of PMC schema. The PMC algorithm keeps a reserved area for each cache working set. The page with high time cost when be swapped into cache will be reserved in this area for future access instead of being swapped out of cache by least recently used (LRU) algorithm. Simulations indicate PMC obviously improve disk throughputs, and system performance is enhanced.