An Improvement in WRP Block Replacement Policy with Reviewing and Solving its Problems

Journal of Advances in Computer Research

مقاله 7، دوره 3، شماره 4، بهمن 2012، صفحه 67-75   

نویسندگان

Davood Akbari Bengar^{* 1}؛ Hoshang Jazayeri Rad²؛ Golnaz Berenjian³

¹Department of Computer Sciences, Science and Research Branch, Islamic Azad University, Khouzestan, Iran

²Department of Computer Sciences, Mahshahr Branch, Islamic Azad University, Mahshahr, Iran

³Tabari Institute of Higher Education

چکیده

One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To overcome the problem of performance gap between hard disks and main memory, there have been lots of proposed policies. Most of these policies are the development of the Least-Recently-Used (LRU) and Least-Frequently-Used (LFU) models. WRP(Weighting Replacement Policy) is a replacement algorithm that its performance is better than the LRU and LFU. The most advantage of this model is it’s similarity to both LRU and LFU, which means it has the benefits of both. This research proposes a new block replacement Policy namely, DWRP (Developed Weighting Replacement Policy) which solves the problems of WRPalgorithm and retains its advantages.

کلیدواژه‌ها

Block replacement policy؛ System performance؛ Main memory؛ Buffering system؛ Speed gap