The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Scheduling fixed-priority tasks with preemption threshold
Abstract
In the context of fixed-priority scheduling, feasibility of a task set with non-preemptive scheduling does not imply the feasibility with preemptive scheduling and vice versa. We use the notion of preemption threshold, first introduced by Express Logic, in their ThreadX real-time operating system, to develop a scheduling model that subsumes both preemptive and non-preemptive fixed priority scheduling. Preemption threshold allows a task to only disable preemption of tasks up to a specified threshold priority. Tasks having priorities higher than the threshold are still allowed to preempt. With this new scheduling model, we show that schedulability is improved as compared to both the preemptive and nonpreemptive scheduling models. We develop the equations for computing the worst-case response times, using the concept of level-i busy period. Some useful results about the generalized model are presented and an algorithm for optimal assignment of priority and preemption threshold is designed based on these results.
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
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
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
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
An 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
OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES
Audsley, N. (2007) · Cited by 318
A stack-based resource allocation policy for realtime processes
Baker, T. P. (1990) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1990.128747 · Cited by 298
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
A Survey of Research into Mixed Criticality Systems
Burns, A., & Davis, R. I. (2018) · ACM Computing Surveys · doi:10.1145/3131347 · Cited by 282
Metadata
- Authors
- Wang, Y., & Saksena, M.
- Venue
- Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 328-335
- OpenAlex
- W2169142010
- Cited by
- 267
- References
- 13
- FWCI
- 6.94
- 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
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.