The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Fixed priority scheduling of periodic task sets with arbitrary deadlines
Abstract
This paper considers the problem of fixed priority scheduling of periodic tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the Liu and Layland bound. The results are shown to provide a basis for developing predictable distributed real-time systems. 1
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
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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
LIU, C. L., & LAYLAND, J. W. (2002) · Readings in Hardware/Software Co-Design · doi:10.1016/b978-155860702-6/50016-8 · Cited by 3,233
The 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-citationOn 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
The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
Strosnider, J. K., Lehoczky, J. P., & Sha, L. (1995) · IEEE Transactions on Computers · doi:10.1109/12.368008 · Cited by 397
Self-citationReal-time scheduling theory and Ada
Sha, L., & Goodenough, J. B. (1990) · Computer · doi:10.1109/2.55469 · Cited by 337
Performance of real-time bus scheduling algorithms
Lehoczky, J. P., & Sha, L. (1986) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/317499.317538 · Cited by 111
Self-citationPerformance of real-time bus scheduling algorithms
Lehoczky, J. P., & Sha, L. (1986) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/317531.317538 · Cited by 78
Self-citation
Cited by
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
Davis, R. I., Burns, A., Bril, R. J., & Lukkien, J. J. (2007) · Real-Time Systems · doi:10.1007/s11241-007-9012-7 · Cited by 786
Holistic schedulability analysis for distributed hard real-time systems
Tindell, K., & Clark, J. (1994) · Microprocessing and Microprogramming · doi:10.1016/0165-6074(94)90080-9 · Cited by 759
Metadata
- Authors
- Lehoczky, J. P.
- Venue
- [1990] Proceedings 11th Real-Time Systems Symposium
- Publisher
- IEEE
- Published
- 1990
- Pages
- 201-209
- ISSN
- 1052-8725 (ISSN-L)
- OpenAlex
- W2145132630
- Cited by
- 802
- References
- 8
- FWCI
- 4.01
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Fixed priority scheduling of periodic task sets with arbitrary deadlines. https://app.cochat.ai/papers/10.1109/real.1990.128748
- The paper
- Lehoczky, J. P. (1990). Fixed priority scheduling of periodic task sets with arbitrary deadlines. [1990] Proceedings 11th Real-Time Systems Symposium. https://doi.org/10.1109/real.1990.128748
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.
