A. Blum, M. L. Furst, and A. Tomkins, What to do with your free time: algorithms for infrequent requests and randomized weighted caching. manuscript, Apr. 1996.  Home/Search   Document Details and Download   Summary   Related Articles

....algorithm is known to have a competitive ratio better than the deterministic ratio of k. However, in some special cases progress has been made. Irani [private communication] has shown an O(log k) competitive algorithm when page fetch costs are one of two possible values. Blum, Furst, and Tomkins [8] have given an O(log 2 k) competitive algorithm for arbitrary page costs, when the total number of pages is k 1, they also give a lower bound of 38 k) for any page costs. Our contributions. In this paper we introduce a general notation and technique for combining algorithms for unfair ....

....metric space, the randomized competitive ratio is O( log n log log n) 2 ) 5.2. K Weighted Caching on K 1 Points. Weighted caching is a generalized paging problem where there is a di erent cost to fetch di erent pages. This problem is equivalent to the K server problem on a star metric space [23, 8]. A star metric space is derived from a depth one tree with distances on the edges, the points of the metric space are the leaves of the tree and the distances between a pair of points is the length of the (2 edge) path between them. This is so, since we can assign any edge (r; u) in the tree a ....

[Article contains additional citation context not shown here]

A. Blum, M. L. Furst, and A. Tomkins, What to do with your free time: algorithms for infrequent requests and randomized weighted caching. manuscript, Apr. 1996.

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