Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005

TY - GEN

T1 - Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005

AU - Burns, Alan

AU - Wellings, Andy J.

AU - Zhang, Fengxiang

PY - 2009

Y1 - 2009

N2 - Earliest Deadline First (EDF) and Fixed Priority (FP) scheduling represent the two main dispatching policies within the research domain of real-time systems engineering. Both dispatching policies are now supported by Ada. In this paper the two approaches are combined to maximize the advantages of both schemes. From EDF comes efficiency, from FP predictability. A system model is presented in which a relatively small number of high-integrity tasks are scheduled by FP, with the rest of the tasks being handled via an EDF domain of lower priority. Two aspects of integration are covered in this paper. Firstly, Response-Time Analysis (for FP) and Processor-Demand Analysis (for EDF) are brought together to provide a single analysis framework. Secondly, the programming of systems which combine FP and EDF is addressed within the facilities provided by Ada 2005. Both partitioned and dynamic schemes are covered.

AB - Earliest Deadline First (EDF) and Fixed Priority (FP) scheduling represent the two main dispatching policies within the research domain of real-time systems engineering. Both dispatching policies are now supported by Ada. In this paper the two approaches are combined to maximize the advantages of both schemes. From EDF comes efficiency, from FP predictability. A system model is presented in which a relatively small number of high-integrity tasks are scheduled by FP, with the rest of the tasks being handled via an EDF domain of lower priority. Two aspects of integration are covered in this paper. Firstly, Response-Time Analysis (for FP) and Processor-Demand Analysis (for EDF) are brought together to provide a single analysis framework. Secondly, the programming of systems which combine FP and EDF is addressed within the facilities provided by Ada 2005. Both partitioned and dynamic schemes are covered.

KW - REAL-TIME TASKS

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

M3 - Conference contribution

SN - 978-3-642-01923-4

VL - 5570 LNCS

SP - 119

EP - 133

BT - RELIABLE SOFTWARE TECHNOLOGIES - ADA-EUROPE 2009

A2 - Kordon, F

A2 - Kermarrec, Y

PB - Springer

CY - BERLIN

T2 - 14th Ada-Europe International Conference on Reliable Software Technologies

Y2 - 8 June 2009 through 12 June 2009

ER -