A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines

DOI10.1109/TC.2008.167zbMath1368.68109OpenAlexW2046941316MaRDI QIDQ4975023

Enrico Bini, Sanjoy K. Baruah, Thi Huyen Chau Nguyen, Pascal Richard

Publication date: 8 August 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2008.167

Mathematics Subject Classification ID

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

Related Items (7)

Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling ⋮ 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 ⋮ Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling ⋮ On-line schedulability tests for adaptive reservations in fixed priority scheduling ⋮ Unnamed Item ⋮ Approximation techniques for response-time analysis of static-priority tasks

This page was built for publication: A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines