Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems

TY - CONF

T1 - Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems

AU - Zhang, Fengxiang

AU - Burns, Alan

N1 - ISBN: 978-0-7695-3724-5

PY - 2009

Y1 - 2009

N2 - Earliest Deadline First (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. Quick Processor-demand Analysis (QPA) provides efficient and exact schedulability tests for EDF scheduling with arbitrary relative deadline. In this paper, we propose Improved Quick Processor-demand Analysis (QPA*) which is based on QPA. By extensive experiments, we show that QPA* can significantly reduce the required calculations to perform an exact test for unschedulable systems. We prove that the computation time for testing schedulable systems is hardly affected. Hence the required calculations for general systems can be significantly decreased.

AB - Earliest Deadline First (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. Quick Processor-demand Analysis (QPA) provides efficient and exact schedulability tests for EDF scheduling with arbitrary relative deadline. In this paper, we propose Improved Quick Processor-demand Analysis (QPA*) which is based on QPA. By extensive experiments, we show that QPA* can significantly reduce the required calculations to perform an exact test for unschedulable systems. We prove that the computation time for testing schedulable systems is hardly affected. Hence the required calculations for general systems can be significantly decreased.

UR - http://www.scopus.com/inward/record.url?scp=70449602667&partnerID=8YFLogxK

U2 - 10.1109/ECRTS.2009.20

DO - 10.1109/ECRTS.2009.20

M3 - Paper

SP - 76

EP - 86

ER -