Marek Chrobak and John Noga. Competitive algorithms for multilevel caching and relaxed list update. Journal of Algorithms, 34(2):282--308, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On List Update and Work Function Algorithms - Anderson, Hildrum, Karlin.. (Correct)
....accessing an item, move it to the front of the list, without changing the relative order of the other items. Move To Front is known to be 2 Gamma 2 k 1 competitive, and this is best possible [2] 7] We note that other cost models have also been considered for the list update problem [6] 9] [10]. Increasing the cost of exchanges to two (instead of one) makes Move To Front optimal; this provides an independent proof that MoveTo Front is two competitive. Other alternatives analyzed in the literature include allowing free exchanges for other than the referenced element, and allowing free ....
....of one) makes Move To Front optimal; this provides an independent proof that MoveTo Front is two competitive. Other alternatives analyzed in the literature include allowing free exchanges for other than the referenced element, and allowing free exchanges between elements that are not adjacent[9] [10]. These alternative cost models can lead to qualitatively different results. 1.2 Metrical task systems The (static) list update problem can also be considered within the metrical task system framework introduced by Borodin, Linial and Saks [8] Metrical task systems (MTS) are an abstract model ....
M. Chrobak and J. Noga. Competitive algorithms for multilevel caching and relaxed list update. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 1998.
Caching and Scheduling for Broadcast Disk Systems - Liberatore (1998) (4 citations) (Correct)
....whereas other works focus on increasing availability or avoiding accesses to stale data. Broadcast disk paging poses a trade off between the number of page faults and the cost per fault. Similar trade offs exist in a variety of context, as for example, Web caching [7, 35] and hierarchical paging [15]. The problem of finding an optimal cyclic schedule is NP hard [12] but it can be solved in polynomial time if ServerDBSize = 2 [11] The square root law has been proposed by several authors [10, 9, 21, 31] The golden ratio algorithm instantiate the rule and gives a 1.125 approximation for all ....
Marek Chrobak and John Noga. Competitive algorithms for multilevel caching and relaxed list update. In Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, pages 87--96, 1998.
More on Weighted Servers or FIFO is better than LRU - Epstein, Imreh, van Stee (2003) (1 citation) (Correct)
No context found.
Marek Chrobak and John Noga. Competitive algorithms for multilevel caching and relaxed list update. Journal of Algorithms, 34(2):282--308, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC