Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement

DOI10.1007/s11241-017-9290-7zbMath1425.68047OpenAlexW2746176605MaRDI QIDQ1698776

Haibo Zeng, Chao Peng

Publication date: 16 February 2018

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

Full work available at URL: https://doi.org/10.1007/s11241-017-9290-7

zbMATH Keywords

schedulability analysisresponse time analysisrequest/interference bound functionsdigraph task models

Mathematics Subject Classification ID

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

Related Items (1)

A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs

Uses Software

• SCADE
• Simulink

Cites Work

• Unnamed Item
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Graph-based models for real-time workload: a survey
• Measuring the performance of schedulability tests
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Linear matrix period in max-plus algebra
• Speed is as powerful as clairvoyance
• A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Faster parametric shortest path and minimum‐balance algorithms

This page was built for publication: Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement