The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Applying new scheduling theory to static priority pre-emptive scheduling
Abstract
The paper presents exact schedulability analyses for real-time systems scheduled at runtime with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) to release jitter, such as waiting for a message to arrive. The analysis presented is more general than that previously published and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the relevant theory, an existing avionics case study is described and analysed. The predictions that follow from this analysis are seen to be in close agreement with the behaviour exhibited during simulation studies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
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
Stack-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
Calculating the maximum execution time of real-time programs
Puschner, P. P., & Koza, C. (1989) · Real-Time Systems · doi:10.1007/bf00571421 · Cited by 573
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
Audsley, N., Burns, A., Richardson, M. F., & Wellings, A. J. (1991) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)51283-5 · Cited by 497
Self-citationAllocating hard real-time tasks: An NP-Hard problem made easy
Tindell, K. W., Burns, A., & Wellings, A. J. (1992) · Real-Time Systems · doi:10.1007/bf00365407 · Cited by 369
Self-citationOPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES
Audsley, N. (2007) · Cited by 318
Self-citationBuilding a predictable avionics platform in Ada: a case study
Locke, C. D., Vogel, D. R., & Mesler, T. J. (2002) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1991.160372 · Cited by 147
STRESS: A simulator for hard real‐time systems
Audsley, N., Burns, A., Richardson, M. F., & Wellings, A. J. (1994) · Software Practice and Experience · doi:10.1002/spe.4380240603 · Cited by 103
Self-citation
Cited by
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
Self-citationAn extendible approach for analyzing fixed priority hard real-time tasks
Tindell, K. W., Burns, A., & Wellings, A. J. (1994) · Real-Time Systems · doi:10.1007/bf01088593 · Cited by 565
Self-citationSystem level performance analysis – the SymTA/S approach
Henia, R., Hamann, A., Jersak, M., Racu, R., Richter, K., & Ernst, R. (2005) · IEE Proceedings - Computers and Digital Techniques · doi:10.1049/ip-cdt:20045088 · Cited by 488
Calculating controller area network (CAN) message response times
Tindell, K., Burns, A., & Wellings, A. (1994) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)45747-8 · Cited by 439
Self-citation
Metadata
- Authors
- Audsley, N., Burns, A., Richardson, M., Tindell, K., & Wellings, A. J.
- Venue
- Software Engineering Journal
- Published
- 1993
- Volume
- 8
- Issue
- 5
- Pages
- 284
- ISSN
- 0268-6961 (ISSN-L)
- OpenAlex
- W2042979415
- Cited by
- 1,106
- References
- 14
- FWCI
- 19.52
- 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.