Hard real-time scheduling problem of periodic tasks in the presence of aperiodic tasks occurrence is analyzed. A hybrid model of the tasks and of the Earliest Deadline First scheduling policy is proposed and its translation into a Mixed Logical Dynamic model is presented. The model is used to design an optimal admission controller that selects the best feasible period for the periodic tasks based on the prediction of the processor utilization.
Rate Admission Control for Hard Real-Time Task Scheduling
Vasca F;Iannelli L
2007-01-01
Abstract
Hard real-time scheduling problem of periodic tasks in the presence of aperiodic tasks occurrence is analyzed. A hybrid model of the tasks and of the Earliest Deadline First scheduling policy is proposed and its translation into a Mixed Logical Dynamic model is presented. The model is used to design an optimal admission controller that selects the best feasible period for the periodic tasks based on the prediction of the processor utilization.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2007_published_hscc_real_time_scheduling_mld.pdf
non disponibili
Licenza:
Non specificato
Dimensione
393.84 kB
Formato
Adobe PDF
|
393.84 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
