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

DOI10.1007/S11241-009-9078-5zbMath1185.68118OpenAlexW2052251387MaRDI QIDQ1039310

Enrico Bini, Thi Huyen Chau Nguyen, Pascal Richard

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)

Related Items (3)

Improved response-time bounds in fixed priority scheduling with arbitrary deadlines ⋮ An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems ⋮ Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling

Cites Work

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

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