کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6888527 1444983 2017 39 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
TTL approximations of the cache replacement algorithms LRU(m) and h-LRU
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
TTL approximations of the cache replacement algorithms LRU(m) and h-LRU
چکیده انگلیسی
We use this approximation and trace-based simulation to compare the performance of h-LRU and LRU(m). First, we show that they perform alike, while the latter requires less work when a hit/miss occurs. Second, we show that as opposed to LRU, h-LRU and LRU(m) are sensitive to the correlation between consecutive inter-request times. Last, we study cache partitioning. In all tested cases, the hit probability improved by partitioning the cache into different parts-each being dedicated to a particular content provider. However, the gain is limited and the optimal partition sizes are very sensitive to the problem's parameters.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Performance Evaluation - Volume 117, December 2017, Pages 33-57
نویسندگان
, ,