联机文件缓存
On-Line File Caching
摘要：
在联机文件缓存问题中，输入是一系列联机文件请求（一次一个）。每个文件都有非负的大小和非负的检索成本。问题是决定哪些文件保留在固定大小的缓存中，以便在请求时最小化不在缓存中的文件的检索成本之和。问题出现在浏览器和代理的Web缓存中。本文描述了一个自然的推广LRU称为地主，并给出了分析表明，它有一个最佳的性能保证（在确定性的在线算法）。本文还给出了一个所谓的"松散“竞争模型中的算法的分析，表明在一个”典型“的缓存大小，要么性能保证是O（1）或总的检索成本是微不足道的。
英文摘要：
In the on-line file-caching problem problem, the input is a sequence of requests for files, given on-line (one at a time). Each file has a non-negative size and a non-negative retrieval cost. The problem is to decide which files to keep in a fixed-size cache so as to minimize the sum of the retrieval costs for files that are not in the cache when requested. The problem arises in web caching by browsers and by proxies. This paper describes a natural generalization of LRU called Landlord and gives an analysis showing that it has an optimal performance guarantee (among deterministic on-line algorithms). The paper also gives an analysis of the algorithm in a so-called ``loosely'' competitive model, showing that on a ``typical'' cache size, either the performance guarantee is O(1) or the total retrieval cost is insignificant.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
