MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
|
The mixed-criticality clairvoyant EDF algorithm implementation. More...
Classes | |
class | ArrivalComparer |
The comparer used to sort task according to their arrival times. | |
class | DeadlineComparer |
The comparer used to sort task according to their deadlines. | |
Public Member Functions | |
void | solve (CMixedCriticalityInstance instance) |
Solves the specified mixed-criticality instance using clairvoyant non-preemptive earliest deadline first algorithm. |
The mixed-criticality clairvoyant EDF algorithm implementation.
This algorithm is based on the algorithm proposed by Cecilia Ekelin, and also described by the same person in the article entitled as Clairvoyant Non-preemptive EDF Scheduling, which may be found in proceedings of the 18th Euromicro Conference on Real-Time Systems.
void MCScheduling.ClairvoyantEDF.ClairvoyantEDF.solve | ( | CMixedCriticalityInstance | instance | ) |
Solves the specified mixed-criticality instance using clairvoyant non-preemptive earliest deadline first algorithm.
instance | The mixed-criticality instance to solve. |