Graph-based models for real-time workload: a survey

DOI10.1007/s11241-015-9234-zzbMath1337.68050OpenAlexW2107233055MaRDI QIDQ497995

Martin Stigge, Wang Yi

Publication date: 25 September 2015

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.705.3644

zbMATH Keywords

surveyscheduling theoryreal-time schedulingschedulability testworkload models

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (4)

An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems ⋮ Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement ⋮ Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand ⋮ A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal resource sharing protocol for generalized multiframe tasks
• Real time scheduling theory: A historical perspective
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
• A note on preemptive scheduling of periodic, real-time tasks
• A theory of timed automata
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
• Schedulability analysis of fixed-priority systems using timed automata
• Task automata: Schedulability, decidability and undecidability
• A survey of hard real-time scheduling for multiprocessor systems
• Hard Real-Time Computing Systems
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
• Scheduling Real-Time Mixed-Criticality Jobs
• Priority inheritance protocols: an approach to real-time synchronization
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Lectures on Concurrency and Petri Nets
• Network calculus. A theory of deterministic queueing systems for the Internet

This page was built for publication: Graph-based models for real-time workload: a survey