Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
New results on server problems
SIAM Journal on Discrete Mathematics
Journal of Algorithms
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics
Preemptive multiprocessor scheduling with rejection
Theoretical Computer Science
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Online scheduling with machine cost and rejection
Discrete Applied Mathematics
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Bin packing problems with rejection penalties and their dual problems
Information and Computation
Bin Packing with Rejection Revisited
Algorithmica
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Caching is hard: even in the fault model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Journal of Computer and System Sciences
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
Operations Research Letters
Hi-index | 0.00 |
In the file caching problem, the input is a sequence of requests for files out of a slow memory. A file has two attributes, a retrieval cost and an integer size. It is required to maintain a cache of size k, bringing each file, which is not present in the cache at the time of request, from the slow memory into the cache. This incurs a cost equal to the retrieval cost of the file. Well-known special cases include paging (all costs and sizes are equal to 1), the cost model which is also known as weighted paging (all sizes are equal to 1), the fault model (all costs are equal to 1) and the bit model (the cost of a file is equal to its size). We study two online variants of the problem, caching with bypassing and caching with rejection. If bypassing is allowed, a miss for a file still results in an access to this file in the slow memory, but its subsequent insertion into the cache is optional. In the model with rejection, together with each request for a file, the algorithm is informed with a rejection penalty of the request. When a file which is not present in the cache is requested, the algorithm must either bring the file into the cache, paying the retrieval cost of the file, or reject the file, paying the rejection penalty of the request. The goal function is the sum of total rejection penalty and the total retrieval cost. We design deterministic and randomized algorithms for both problems. The competitive ratios of these randomized algorithms match the best known results for caching. In the deterministic case, it is known that a (k + 1)-competitive algorithm for caching with bypassing exists, and this is best possible. In contrast, we present a lower bound of 2k+1 on the competitive ratio of any deterministic algorithm for the variant with rejection, which holds already for paging. We design a (2k+2)-competitive algorithm for caching with rejection, and a different (2k+1)-competitive algorithm, which is applicable for paging, the bit model and the cost model.