Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917)

From MaRDI portal
Revision as of 18:21, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing periodic request functions to speed-up the analysis of non-cyclic task models
scientific article

    Statements

    Computing periodic request functions to speed-up the analysis of non-cyclic task models (English)
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    real-time schedulability
    0 references
    task graph model
    0 references
    max-plus algebra
    0 references
    request/demand bound functions
    0 references

    Identifiers