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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11241-014-9209-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004926808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic- and static-priority scheduling of recurring real-time tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a graph's period quadratically by node condensation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New transience bounds for max-plus linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task automata: Schedulability, decidability and undecidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear matrix period in max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for linear matrix period in max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transience Bounds for Long Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Nachtigall's Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized matrix period in max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-core real-time scheduling for generalized parallel task models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial abstraction refinement for feasibility analysis of static priorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact scheduling analysis of non-accumulatively monotonic multiframe tasks / rank
 
Normal rank

Latest revision as of 18:21, 10 July 2024

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