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

DOI10.1007/S11241-014-9209-5MaRDI QIDQ495917zbMATH OpenOpenAlexFDO

Authors Haibo Zeng, Marco Di Natale

Publication date 16 September 2015

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-014-9209-5

zbMATH Keywords

max-plus algebrareal-time schedulabilityrequest/demand bound functionstask graph model

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Modeling, analyzing and slicing periodic distributed computations
• Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions
• Approximation techniques for response-time analysis of static-priority tasks
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Performance analysis of the parallel cyclic two-stage queueing model
• Feasibility analysis of real-time periodic tasks with offsets

Cites work

• A characterization of the minimum cycle mean in a digraph
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Computational Complexity of Nachtigall's Representation
• Computing a graph's period quadratically by node condensation
• Depth-First Search and Linear Graph Algorithms
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
• Faster parametric shortest path and minimum‐balance algorithms
• Generalized matrix period in max-plus algebra
• scientific article; zbMATH DE number 627763 (Why is no real title available?)
• Linear matrix period in max-plus algebra
• Multi-core real-time scheduling for generalized parallel task models
• New transience bounds for max-plus linear systems
• Polynomial algorithm for linear matrix period in max-plus algebra
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Task automata: Schedulability, decidability and undecidability
• Transience bounds for long walks

Cited in

(3)

• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
• A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
• Reduction-based schedulability analysis of distributed systems with cycles in the task graph

Describes a project that uses

Uses Software

• RTC toolbox
• Algorithm 97

This page was built for publication: Computing periodic request functions to speed-up the analysis of non-cyclic task models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495917)