Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 171

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Fixed priority scheduling periodic tasks with varying execution priority

Harbour, M.G., Klein, M.H., Lehoczky, J.P. · 2002 · [1991] Proceedings Twelfth Real-Time Systems Symposium

Abstract

The problem of fixed priority scheduling of periodic tasks where each task's execution priority may vary is considered. Periodic tasks are decomposed into serially executed subtasks, where each subtask is characterized by an execution time and a fixed priority and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theoretical underpinnings. This method can be used to analyze the schedulability of complex task sets which involve interrupts, certain synchronization protocols, nonpreemptible sections and, in general, any mechanism that contributes to a complex priority structure. The authors introduce a simple but realistic real-time robotics application and illustrate how one uses the schedulability equations presented.>

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/real.1991.160365

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 171

Metadata

Authors
Harbour, M. G., Klein, M. H., & Lehoczky, J. P.
Venue
[1991] Proceedings Twelfth Real-Time Systems Symposium
Published
2002-12-09
Pages
116-128
ISSN
1052-8725 (ISSN-L)
OpenAlex
W1702973254
Cited by
171
References
1
FWCI
12.58
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fixed priority scheduling periodic tasks with varying execution priority. https://app.cochat.ai/papers/10.1109/real.1991.160365
The paper
Harbour, M. G., Klein, M. H., & Lehoczky, J. P. (2002). Fixed priority scheduling periodic tasks with varying execution priority. [1991] Proceedings Twelfth Real-Time Systems Symposium. https://doi.org/10.1109/real.1991.160365

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.