On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (Q255296)

From MaRDI portal
Revision as of 16:10, 8 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)





scientific article
Language Label Description Also known as
English
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
scientific article

    Statements

    On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    real-time scheduling
    0 references
    global fixed-priority pre-emptive scheduling
    0 references
    optimal priority assignment
    0 references
    exact schedulability tests
    0 references
    sporadic tasks
    0 references
    periodic tasks
    0 references

    Identifiers