Task parameter computations for constraint deadline real-time systems with EDF scheduling

TY - GEN

T1 - Task parameter computations for constraint deadline real-time systems with EDF scheduling

AU - Zhang, Fengxiang

AU - Burns, Alan

AU - Baruah, Sanjoy

PY - 2010/8/27

Y1 - 2010/8/27

N2 - The correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is very useful in an engineering context to know what changes to task relative deadline and period (interarrival time) can be made to a task that will deliver a schedulable system. In this paper, we address the sensitivity analysis (task parameter computations) of relative deadline and period for EDF scheduled systems on a uniprocessor when the ratio of deadline to period is a fixed value. We show that a task relative deadline and period which will result in a system that is borderline schedulable can be determined by a single pass of the QPA algorithm. This algorithm provides exact and efficient sensitivity analysis for arbitrary deadline real-time systems. The approaches developed for task parameter computations are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

AB - The correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is very useful in an engineering context to know what changes to task relative deadline and period (interarrival time) can be made to a task that will deliver a schedulable system. In this paper, we address the sensitivity analysis (task parameter computations) of relative deadline and period for EDF scheduled systems on a uniprocessor when the ratio of deadline to period is a fixed value. We show that a task relative deadline and period which will result in a system that is borderline schedulable can be determined by a single pass of the QPA algorithm. This algorithm provides exact and efficient sensitivity analysis for arbitrary deadline real-time systems. The approaches developed for task parameter computations are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

KW - Embedded systems

KW - Performance and reliability

KW - Real-time systems

KW - Sensitivity analysis

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

U2 - 10.1109/ICCDA.2010.5541363

DO - 10.1109/ICCDA.2010.5541363

M3 - Conference contribution

AN - SCOPUS:77955884937

SN - 9781424471638

VL - 3

SP - V3-553 -V3-557

BT - Proceedings of International Conference onComputer Design and Applications (ICCDA)

T2 - 2010 International Conference on Computer Design and Applications, ICCDA 2010

Y2 - 25 June 2010 through 27 June 2010

ER -