The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Thek-server dual and loose competitiveness for paging
Open accessAbstract
Weighted caching is a generalization ofpaging in which the cost to evict an item depends on the item. We study both of these problems as restrictions of the well-knownk-server problem, which involves moving servers in a graph in response to requests so as to minimize the distance traveled.We give a deterministic on-line strategy for weighted caching that, on any sequence of requests, given a cache holdingk items, incurs a cost within a factor ofk/(k−h+1) of the minimum cost possible given a cache holdingh items. The strategy generalizes “least recently used,” one of the best paging strategies in practice. The analysis is a primal-dual analysis, the first for an on-line problem, exploiting the linear programming structure of thek-server problem.We introduceloose competitiveness, motivated by Sleator and Tarjan's complaint [ST] that the standard competitive ratios for paging strategies are too high. Ak-server strategy islooselyc(k)-competitive if, for any sequence, foralmost all k, the cost incurred by the strategy withk serverseither is no more thanc(k) times the minimum costor is insignificant.We show that certain paging strategies (including “least recently used,” and “first in first out”) that arek-competitive in the standard model are looselyc(k)-competitive providedc(k)/Ink→∞ and bothk/c(k) andc(k) are nondecreasing. We show that the marking algorithm, a randomized paging strategy that is Θ(Ink)-competitive in the standard model, is looselyc(k)-competitive providedk−2 In Ink→∞ and both 2 Ink−c(k) andc(k) are nondecreasing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
A General Approximation Technique for Constrained Forest Problems
Goemans, M. X., & Williamson, D. P. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793242618 · Cited by 884
Combinatorial optimization: algorithms and complexity
Papadimitriou, C. H., & Steiglitz, K. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 486
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457
Self-citationCompetitive algorithms for server problems
Manasse, M. S., McGeoch, L. A., & Sleator, D. D. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90003-w · Cited by 425
On the power of randomization in on-line algorithms
Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1994) · Algorithmica · doi:10.1007/bf01294260 · Cited by 262
A strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238
New Ressults on Server Problems
Chrobak, M., Karloof, H., Payne, T., & Vishwnathan, S. (1991) · SIAM Journal on Discrete Mathematics · doi:10.1137/0404017 · Cited by 208
On the power of randomization in online algorithms
Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100268 · Cited by 174
An optimal online algorithm for metrical task systems
Borodin, A., Linial, N., & Saks, M. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28435 · Cited by 164
An Optimal On-Line Algorithm for K Servers on Trees
Chrobák, M., & Larmore, L. L. (1991) · SIAM Journal on Computing · doi:10.1137/0220008 · Cited by 161
Strongly Competitive Algorithms for Paging with Locality of Reference
Irani, S., Karlin, A. R., & Phillips, S. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539792236353 · Cited by 121
On-line caching as cache size varies
Young, N. E. (1991) · Symposium on Discrete Algorithms · doi:10.5555/127787.127832 · Cited by 101
Self-citationCompetitive paging with locality of reference
Borodin, A., Raghavan, P., Irani, S., & Schieber, B. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103422 · Cited by 85
New results on server problems
Chrobák, M., Karloff, H. J., Payne, T., & Vishwanathan, S. (1990) · doi:10.5555/320176.320209 · Cited by 55
Cited by
CFLRU: a replacement algorithm for flash memory
Park, S.-Y., Jung, D., Kang, J.-U., Kim, J.-S., & Lee, J. (2006) · Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems · doi:10.1145/1176760.1176789 · Cited by 385
Koutsoupias, E., & Papadimitriou, C. H. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539796299540 · Cited by 277
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Buchbinder, N., & (Seffi) Naor, J. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982179 · Cited by 260
Competitive analysis of randomized paging algorithms
Achlioptas, D., Chrobak, M., & Noga, J. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00116-9 · Cited by 127
Young, N. E. (2002) · Algorithmica · doi:10.1007/s00453-001-0124-5 · Cited by 105
Self-citation
Metadata
- Authors
- Young, N.
- Venue
- Algorithmica
- Published
- 1994-06
- Volume
- 11
- Issue
- 6
- Pages
- 525-541
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2042789015
- Cited by
- 252
- References
- 17
- FWCI
- 3.48
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.