The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
An extendible approach for analyzing fixed priority hard real-time tasks
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
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
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
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
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
Self-citationStack-based scheduling of realtime processes
Baker, T. P. (1991) · Real-Time Systems · doi:10.1007/bf00365393 · Cited by 817
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
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
Self-citationReal-time synchronization protocols for multiprocessors
Rajkumar, R., Sha, L., & Lehoczky, J. P. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1988.51121 · Cited by 403
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
Self-citationHolistic 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
Self-citationReal Time Scheduling Theory: A Historical Perspective
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 Systems · doi:10.1023/b:time.0000045315.61234.1e · Cited by 614
Self-citationCalculating controller area network (can) message response times
Tindell, K., Burns, A., & Wellings, A. J. (1995) · Control Engineering Practice · doi:10.1016/0967-0661(95)00112-8 · Cited by 420
Self-citation
Metadata
- Authors
- Tindell, K. W., Burns, A., & Wellings, A. J.
- Venue
- Real-Time Systems
- Published
- 1994-03
- Volume
- 6
- Issue
- 2
- Pages
- 133-151
- ISSN
- 0922-6443 (ISSN-L)
- 1573-1383
- OpenAlex
- W2015717967
- Cited by
- 565
- References
- 15
- FWCI
- 15.73
- 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.
