The relative worst-order ratio applied to paging
نویسندگان
چکیده
منابع مشابه
Separating Scheduling Algorithms with the Relative Worst Order Ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...
متن کاملSeparating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...
متن کاملThe Relative Worst Order Ratio for On-Line Bin Packing Algorithms∗
The relative worst order ratio, a new measure for the quality of online algorithms, was defined in [3]. Classical bin packing algorithms such as First-Fit, Best-Fit, and Next-Fit were analyzed using this measure, giving results that are consistent with those previously obtained with the competitive ratio or the competitive ratio on accommodating sequences, but also giving new separations and ea...
متن کاملRelative Worst-Order Analysis: A Survey
Relative worst-order analysis is a technique for assessing the relative quality of online algorithms. We survey the most important results obtained with this technique and compare it with other quality measures.
متن کاملOn the Relative Dominance of Paging Algorithms
In this paper we give a finer separation of several known paging algorithms using a new technique called relative interval analysis. This technique compares the fault rate of two paging algorithms across the entire range of inputs of a given size rather than in the worst case alone. Using this technique we characterize the relative performance of LRU and LRU-2, as well as LRU and FWF, among oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2007
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.03.001