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

سال انتشار: 1391
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 520

فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JACR-3-4_007

تاریخ نمایه سازی: 16 شهریور 1395

چکیده مقاله:

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

نویسندگان

Davood Akbari Bengar

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

Hoshang Jazayeri Rad

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

Golnaz Berenjian

Tabari Institute of Higher Education