The DOI matches its Crossref record; 138 of the 138 references it cites were found in a registry or an index.
Real Time Scheduling Theory: A Historical Perspective
Open accessOverview
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
(1979) · Cited by 43,841
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Feedback control of dynamic systems
Kahne, S. (1987) · Automatica · doi:10.1016/0005-1098(87)90017-3 · Cited by 3,450
Priority inheritance protocols: an approach to real-time synchronization
Sha, L., Rajkumar, R., & Lehoczky, J. P. (1990) · IEEE Transactions on Computers · doi:10.1109/12.57058 · Cited by 2,244
Self-citationThe rate monotonic scheduling algorithm: exact characterization and average case behavior
Lehoczky, J. P., Sha, L., & Ding, Y. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1989.63567 · Cited by 1,477
Self-citationHandbook of Scheduling: Algorithms, Models, and Performance Analysis
Leung, J., Kelly, L., & Anderson, J. H. (2004) · Cited by 1,226
Finding Response Times in a Real-Time System
Joseph, M. (1986) · The Computer Journal · doi:10.1093/comjnl/29.5.390 · Cited by 1,169
On the complexity of fixed-priority scheduling of periodic, real-time tasks
Leung, J. Y.-T., & Whitehead, J. (1982) · Performance Evaluation · doi:10.1016/0166-5316(82)90024-4 · Cited by 1,154
Feedback Control of Computing Systems
Hellerstein, J. L., Diao, Y., Parekh, S., & Tilbury, D. M. (2004) · Wiley eBooks · doi:10.1002/047166880x · Cited by 972
On designing improved controllers for AQM routers supporting TCP flows
Hollot, C. V., Misra, V., Towsley, D., & Gong, W.-B. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916670 · Cited by 958
Cited by
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
Self-citation(2013) · Journal of the Indian Institute of Science · Cited by 75
Metadata
- Authors
- Sha, L., Abdelzaher, T., årzén, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., & Mok, A. K.
- Venue
- Real-Time Systems
- Published
- 2004-11
- Volume
- 28
- Issue
- 2-3
- Pages
- 101-155
- ISSN
- 0922-6443 (ISSN-L)
- 1573-1383
- OpenAlex
- W2012912569
- Cited by
- 614
- References
- 138
- FWCI
- 40.62
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Real Time Scheduling Theory: A Historical Perspective. https://app.cochat.ai/papers/10.1023/b:time.0000045315.61234.1e
- The paper
- Sha, L., Abdelzaher, T., årzén, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., & Mok, A. K. (2004). Real Time Scheduling Theory: A Historical Perspective. Real-Time Systems. https://doi.org/10.1023/b%3Atime.0000045315.61234.1e
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.
