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

DOI10.1007/S11241-017-9290-7MaRDI QIDQ1698776zbMATH OpenOpenAlexFDO

Authors Chao Peng, Haibo Zeng

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

digraph task modelsrequest/interference bound functionsresponse time analysisschedulability analysis

Mathematics Subject Classification ID

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

Recommendations

• Approximation techniques for response-time analysis of static-priority tasks
• Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
• A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
• Response Time Bounds for DAG Tasks with Arbitrary Intra-Task Priority Assignment
• scientific article; zbMATH DE number 986997
• An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation

Cites work

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

Cited in

(7)

• Approximation techniques for response-time analysis of static-priority tasks
• Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling
• Response Time Bounds for DAG Tasks with Arbitrary Intra-Task Priority Assignment
• Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
• A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Efficient implementation of tight response-times for tasks with offsets

Describes a project that uses

Uses Software

• SCADE
• Simulink

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

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