The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Speed is as powerful as clairvoyance
Open accessAbstract
We introduce resource augmentation as a method for analyzing online scheduling problems. In resource augmentation analysis the on-line scheduler is given more resources, say faster processors or more processors, than the adversary. We apply this analysis to two well-known on-line scheduling problems, the classic uniprocessor CPU scheduling problem 1 | r i , pmtn|Σ F i , and the best-effort firm real-time scheduling problem 1| r i , pmtn | Σ w i ( 1- U i ). It is known that there are no constant competitive nonclairvoyant on-line algorithms for these problems. We show that there are simple on-line scheduling algorithms for these problems that are constant competitive if the online scheduler is equipped with a slightly faster processor than the adversary. Thus, a moderate increase in processor speed effectively gives the on-line scheduler the power of clairvoyance. Furthermore, the on-line scheduler can be constant competitive on all inputs that are not closely correlated with processor speed. We also show that the performance of an on-line scheduler is best-effort real time scheduling can be significantly improved if the system is designed in such a way that the laxity of every job is proportional to its length.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Thek-server dual and loose competitiveness for paging
Young, N. (1994) · Algorithmica · doi:10.1007/bf01189992 · Cited by 252
Motwani, R., Phillips, S., & Torng, E. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90151-1 · Cited by 232
On the competitiveness of on-line real-time task scheduling
Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A. U., Rosier, L. E., Shasha, D. E., & Wang, F. (1992) · Real-Time Systems · doi:10.1007/bf00365406 · Cited by 178
A new measure for the study of on-line algorithms
Ben-David, S., & Borodin, A. (1994) · Algorithmica · doi:10.1007/bf01294264 · Cited by 141
Scheduling for overload in real-time systems
Baruah, S., & Haritsa, J. R. (1997) · IEEE Transactions on Computers · doi:10.1109/12.620484 · Cited by 87
Edmonds, J. A. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301299 · Cited by 71
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
Koren, G., & Shasha, D. E. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90165-1 · Cited by 64
A statistical adversary for on-line algorithms
Raghavan, P. (1992) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/007/05 · Cited by 58
Minimizing flow time nonclairvoyantly
Kalyanasundaram, B., & Pruhs, K. R. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646123 · Cited by 28
Self-citation
Cited by
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
A survey of hard real-time scheduling for multiprocessor systems
Davis, R. I., & Burns, A. (2011) · ACM Computing Surveys · doi:10.1145/1978802.1978814 · Cited by 907
Algorithmic problems in power management
Irani, S., & Pruhs, K. R. (2005) · ACM SIGACT News · doi:10.1145/1067309.1067324 · Cited by 303
Self-citationA Survey of Research into Mixed Criticality Systems
Burns, A., & Davis, R. I. (2018) · ACM Computing Surveys · doi:10.1145/3131347 · Cited by 282
Roughgarden, T., & Tardos, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892069 · Cited by 277
Metadata
- Authors
- Kalyanasundaram, B., & Pruhs, K.
- Venue
- Journal of the ACM
- Published
- 2000-07
- Volume
- 47
- Issue
- 4
- Pages
- 617-643
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W276536446
- Cited by
- 561
- References
- 10
- FWCI
- 36.14
- 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
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.