The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
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
Bounds for Certain Multiprocessing Anomalies
Graham, R. L. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb01709.x · Cited by 1,647
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Muntz, R. R., & Coffman, E. G. (1970) · Journal of the ACM · doi:10.1145/321574.321586 · Cited by 162
A scheduling philosophy for multiprocessing systems
Lampson, B. (1968) · Communications of the ACM · doi:10.1145/363095.363144 · Cited by 103
A Survey of Analytical Time-Sharing Models
McKinney, J. M. (1969) · ACM Computing Surveys · doi:10.1145/356546.356549 · Cited by 94
Production and Stabilization of Real-Time Task Schedules
Manacher, G. K. (1967) · Journal of the ACM · doi:10.1145/321406.321408 · Cited by 90
Programming Real-Time Computer Systems
Ernst, H. M., & Martin, J. L. (1966) · Mathematics of Computation · doi:10.2307/2003621 · Cited by 63
Multiprogram scheduling: parts 1 and 2. introduction and theory
Codd, E. F. (1960) · Communications of the ACM · doi:10.1145/367297.367317 · Cited by 48
A policy-driven scheduler for a time-sharing system
Bernstein, A. J., & Sharp, J. C. (1971) · Communications of the ACM · doi:10.1145/362515.362520 · Cited by 33
Sequencing Aspects of Multiprogramming
Heller, J. (1961) · Journal of the ACM · doi:10.1145/321075.321086 · Cited by 28
Multiprogram scheduling: parts 3 and 4. scheduling algorithm and external constraints
Codd, E. F. (1960) · Communications of the ACM · doi:10.1145/367349.367356 · Cited by 19
Cited by
Dally, W. J. (1992) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.127260 · Cited by 1,156
Applying new scheduling theory to static priority pre-emptive scheduling
Audsley, N., Burns, A., Richardson, M., Tindell, K., & Wellings, A. J. (1993) · Software Engineering Journal · doi:10.1049/sej.1993.0034 · Cited by 1,106
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
Fixed priority scheduling of periodic task sets with arbitrary deadlines
Lehoczky, J. P. (1990) · [1990] Proceedings 11th Real-Time Systems Symposium · doi:10.1109/real.1990.128748 · Cited by 802
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
Metadata
- Authors
- LIU, C. L., & LAYLAND, J. W.
- Venue
- Readings in Hardware/Software Co-Design
- Publisher
- Elsevier
- Published
- 2002
- Pages
- 179-194
- OpenAlex
- W2262960161
- Cited by
- 3,233
- References
- 11
- FWCI
- 265.61
- Type
- book chapter
- 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: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. https://app.cochat.ai/papers/10.1016/b978-155860702-6/50016-8
- The paper
- LIU, C. L., & LAYLAND, J. W. (2002). Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Readings in Hardware/Software Co-Design. https://doi.org/10.1016/b978-155860702-6/50016-8
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.