The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
Abstract
This paper is based on a conjecture that the more confidence one needs in a task execution time bound (the less tolerant one is of missed deadlines), the larger and more conservative that bound tends to become in practice. We assume different tasks perform functions having different criticalities and requiring different levels of assurance. We assume a task may have a set of alternative worst-case execution times, each assured to a different level of confidence. This paper presents ways to use this information to obtain more precise schedulability analysis and more efficient preemptive fixed priority scheduling. These methods are evaluated using workloads abstracted from production avionics systems.
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
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
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
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
Tobagi, F., & Kleinrock, L. (1975) · IEEE Transactions on Communications · doi:10.1109/tcom.1975.1092767 · Cited by 1,578
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
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Mok, A. K. (1983) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 852
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
Differentiation mechanisms for IEEE 802.11
Aad, I., & Castelluccia, C. (2002) · doi:10.1109/infcom.2001.916703 · Cited by 555
Analysing real-time communications: controller area network (CAN)
Tindell, Hansson, & Wellings (1994) · Proceedings Real-Time Systems Symposium REAL-94 · doi:10.1109/real.1994.342710 · Cited by 427
OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES
Audsley, N. (2007) · Cited by 318
An implicit prioritized access protocol for wireless sensor networks
Caccamo, M., Zhang, L. Y., Sha, L., & Buttazzo, G. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.2002.1181560 · Cited by 285
On Real-Time Capacity Limits of Multihop Wireless Sensor Networks
Abdelzaher, T., Prabh, S., & Kiran, R. K. S. (2005) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.2004.37 · Cited by 134
Fixed-priority sensitivity analysis for linear compute time models
Vestal, S. (1994) · IEEE Transactions on Software Engineering · doi:10.1109/32.277577 · Cited by 87
Self-citationWiDom: A Dominance Protocol for Wireless Medium Access
Pereira, N., Andersson, B., & Tovar, E. (2007) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2007.898461 · Cited by 84
Carley, T. W., Ba, M., Barua, R. K., & Stewart, D. B. (2004) · International Symposium on System-on-Chip · doi:10.1109/real.2003.1253276 · Cited by 73
Implementation of a Dominance Protocol for Wireless Medium Access
Pereira, N., Andersson, B., & Tovar, E. (2006) · IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA) · doi:10.1109/rtcsa.2006.37 · Cited by 15
Cited by
Real-Time Wireless Sensor-Actuator Networks for Industrial Cyber-Physical Systems
Lu, C., Saifullah, A., Li, B., Sha, M., Gonzalez, H., Gunatilaka, D., Wu, C., Nie, L., & Chen, Y. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2497161 · Cited by 388
Metadata
- Authors
- Vestal, S.
- Venue
- 28th IEEE International Real-Time Systems Symposium (RTSS 2007)
- Publisher
- IEEE
- Published
- 2007-12
- Pages
- 239-243
- ISSN
- 1052-8725 (ISSN-L)
- OpenAlex
- W2137189977
- Cited by
- 547
- References
- 17
- FWCI
- 3.72
- 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.