Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling

DOI10.1016/j.ipl.2016.08.001zbMath1386.68027OpenAlexW2488924876MaRDI QIDQ318911

Jian-Jia Chen, Georg von der Brüggen, Robert I. Davis, Wen-Hung Huang

Publication date: 6 October 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://eprints.whiterose.ac.uk/103630/1/LinearSpeed.pdf

zbMATH Keywords

real-time systemsfixed-priority real-time schedulingnon-preemptive and preemptive schedulingschedulability testsspeedup factors

Mathematics Subject Classification ID

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

Related Items (1)

Exact speedup factors and sub-optimality for non-preemptive scheduling

Cites Work

• Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
• Optimal priority assignment in the presence of blocking
• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
• On priority assignment in fixed priority scheduling
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• 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

This page was built for publication: Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling