The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
An optimal on-line algorithm for metrical task system
Open accessAbstract
In practice, almost all dynamic systems require decisions to be made on-line, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed. It is shown that, for an important class of special cases, this algorithm is optimal among all on-line algorithms. Specifically, a task system ( S,d ) for processing sequences of tasks consists of a set S of states and a cost matrix d where d ( i, j is the cost of changing from state i to state j (we assume that d satisfies the triangle inequality and all diagonal entries are 0). The cost of processing a given task depends on the state of the system. A schedule for a sequence T 1 , T 2 ,…, T k of tasks is a sequence s 1 , s 2 ,…, s k of states where s i is the state in which T i is processed; the cost of a schedule is the sum of all task processing costs and the state transition costs incurred. An on-line scheduling algorithm is one that chooses s i only knowing T 1 T 2 … T i . Such an algorithm is w -competitive if, on any input task sequence, its cost is within an additive constant of w times the optimal offline schedule cost. The competitive ratio w ( S , d ) is the infimum w for which there is a w -competitive on-line scheduling algorithm for ( S , d ). It is shown that w ( S , d ) = 2|S|–1 for every task system in which d is symmetric, and w ( S, d ) = O (| S | 2 ) for every task system. Finally, randomized on-line scheduling algorithms are introduced. It is shown that for the uniform task system (in which d ( i,j ) = 1 for all i,j ), the expected competitive ratio w¯ ( S,d ) = O (log|S|).
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
Applied Probability Models with Optimization Applications.
Gani, J., & Ross, S. M. (1971) · Journal of the American Statistical Association · doi:10.2307/2284258 · Cited by 2,195
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
Stochastic models in operations research
Heyman, D. P., & Sobel, M. J. (1982) · Medical Entomology and Zoology · Cited by 1,041
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631 · cited 3×
“u is a function only of the first i tasks T 1T z . co T’ and SO; that is, the tasks are received one at a time in order and the algorithm must output u(i) upon receiving T’. To measure the efficiency of an on-line algorithm A as compared to the optimal (off-line) algorithm, we say that A is w-competitive (after [ 15 ]…”
BackgroundInfluentialAmortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
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
Competitive 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
A strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238
On self-organizing sequential search heuristics
Rivest, R. (1976) · Communications of the ACM · doi:10.1145/359997.360000 · Cited by 226
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
Cited by
Dynamic right-sizing for power-proportional data centers
Lin, M., Wierman, A., Andrew, L. L. H., & Thereska, E. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5934885 · Cited by 437
Online algorithms for geographical load balancing
Lin, M., Liu, Z., Wierman, A., & Andrew, L. L. H. (2012) · 2012 International Green Computing Conference (IGCC) · doi:10.1109/igcc.2012.6322266 · Cited by 290
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
Self-citationCompetitive randomized algorithms for nonuniform problems
Karlin, A. R., Manasse, M. S., McGeoch, L. A., & Owicki, S. (1994) · Algorithmica · doi:10.1007/bf01189993 · Cited by 258
Metadata
- Authors
- Borodin, A., Linial, N., & Saks, M. E.
- Venue
- Journal of the ACM
- Published
- 1992-10
- Volume
- 39
- Issue
- 4
- Pages
- 745-763
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2114538202
- Cited by
- 326
- References
- 19
- FWCI
- 10.32
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An optimal on-line algorithm for metrical task system. https://app.cochat.ai/papers/10.1145/146585.146588
- The paper
- Borodin, A., Linial, N., & Saks, M. E. (1992). An optimal on-line algorithm for metrical task system. Journal of the ACM. https://doi.org/10.1145/146585.146588
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.