The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Priority inheritance protocols: an approach to real-time synchronization
Abstract
An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol. Both protocols solve the uncontrolled priority inversion problem. The priority ceiling protocol solves this uncontrolled priority inversion problem particularly well; it reduces the worst-case task-blocking time to at most the duration of execution of a single critical section of a lower-priority task. This protocol also prevents the formation of deadlocks. Sufficient conditions under which a set of periodic tasks using this protocol may be scheduled is derived.>
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
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-citationFUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Mok, A. K. (1983) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 852
A note on preemptive scheduling of periodic, real-time tasks
Leung, J. Y. ‐., & Merrill, M. L. (1980) · Information Processing Letters · doi:10.1016/0020-0190(80)90123-4 · Cited by 424
Dynamic Task Scheduling in Hard Real-Time Distributed systems
Ramamritham, K., & Stankovic, J. A. (1984) · IEEE Software · doi:10.1109/ms.1984.234713 · Cited by 246
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
Zhao, W., Ramamritham, K., & Stankovic, J. A. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233201 · Cited by 225
Guaranteed Response Times in a Hard-Real-Time Environment
Leinbaugh, D. W. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.234465 · Cited by 151
The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks
Goodenough, J. B., & Sha, L. (1988) · doi:10.1145/58612.59371 · Cited by 135
Self-citationPerformance 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
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
Cyber–Physical Systems: A Perspective at the Centennial
Kim, K.-D., & Kumar, P. R. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2189792 · Cited by 761
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
Lottery scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1994) · doi:10.5555/1267638.1267639 · Cited by 637
Metadata
- Authors
- Sha, L., Rajkumar, R., & Lehoczky, J. P.
- Venue
- IEEE Transactions on Computers
- Published
- 1990
- Volume
- 39
- Issue
- 9
- Pages
- 1175-1185
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2160293203
- Cited by
- 2,244
- References
- 10
- FWCI
- 47.00
- Type
- journal article
- 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
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.