Approximation techniques for response-time analysis of static-priority tasks

DOI10.1007/S11241-009-9078-5MaRDI QIDQ1039310zbMATH OpenOpenAlexFDO

Authors Thi Huyen Chau Nguyen, Pascal Richard, Enrico Bini

Publication date 27 November 2009

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

Full work available at URL https://doi.org/10.1007/s11241-009-9078-5

zbMATH Keywords

approximation schemeworst-case response timestatic-priority tasksuniprocessor real-time scheduling

Mathematics Subject Classification ID

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

Recommendations

• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
• Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
• Efficient implementation of tight response-times for tasks with offsets
• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
• A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Cites work

• A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
• Efficient implementation of tight response-times for tasks with offsets
• Measuring the performance of schedulability tests

Cited in

(13)

• Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
• Efficient implementation of tight response-times for tasks with offsets
• Research and Development of an Algorithm for the Response Time Estimation in Multiprocessor Systems Under the Interval Uncertainty of the Tasks Execution Times
• An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol
• Abstract response-time analysis: a formal foundation for the busy-window principle
• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• scientific article; zbMATH DE number 2087818 (Why is no real title available?)
• Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
• A residual service curve of rate-latency server used by sporadic flows computable in quadratic time for network calculus

This page was built for publication: Approximation techniques for response-time analysis of static-priority tasks

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