The DOI matches its Crossref record.
Finding Response Times in a Real-Time System
Abstract
There are two major performance issues in a real-time system where a processor has a set of devices connected to it at different priority levels. The first is to prove whether, for a given assignment of devices to priority levels, the system can handle its peak processing load without losing any inputs from the devices. The second is to determine the response time for each device. There may be several ways of assigning the devices to priority levels so that the peak processing load is met, but only some (or perhaps none) of these ways will also meet the response-time requirements for the devices. In this paper, we define a condition that must be met to handle the peak processing load and describe how exact worst-case response times can then be found. When the condition cannot be met, we show how the addition of buffers for inputs can be useful. Finally, we discuss the use of multiple processors in systems for real-time applications.
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
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
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
Real 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
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
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
Vestal, S. (2007) · 28th IEEE International Real-Time Systems Symposium (RTSS 2007) · doi:10.1109/rtss.2007.47 · Cited by 547
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
Resource kernels: a resource-centric approach to real-time and multimedia systems:
Rajkumar, R., Juvva, K., Molano, A., & Oikawa, S. (1997) · SPIE Proceedings · doi:10.1117/12.298417 · Cited by 317
A Survey of Research into Mixed Criticality Systems
Burns, A., & Davis, R. I. (2018) · ACM Computing Surveys · doi:10.1145/3131347 · Cited by 282
Scheduling fixed-priority tasks with preemption threshold
Wang, Y., & Saksena, M. (2003) · Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306) · doi:10.1109/rtcsa.1999.811269 · Cited by 267
Metadata
- Authors
- Joseph, M.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1986-05-01
- Volume
- 29
- Issue
- 5
- Pages
- 390-395
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2086061827
- Cited by
- 1,169
- References
- 0
- FWCI
- 1.46
- 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.