Scheduling Aperiodic and Sporadic Jobs in Priority- Driven Systems
Scheduling Aperiodic and Sporadic Jobs in Priority- Driven Systems
Scheduling Aperiodic and Sporadic Jobs in Priority- Driven Systems
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Acceptance Test <strong>in</strong> Fixed-<br />
<strong>Priority</strong> <strong>Systems</strong><br />
l� When there are already n accepted sporadic jobs <strong>in</strong><br />
the system, the scheduler computes the slack σ s,i of<br />
S i accord<strong>in</strong>g to<br />
where ξ s,k is the execution time of the completed<br />
portion of the sporadic job S k<br />
IL2212 Embedded Software 47<br />
Acceptance Test <strong>in</strong> Fixed-<br />
<strong>Priority</strong> <strong>Systems</strong><br />
l� If the slack σ s,i for the new sporadic job is not less<br />
than 0, we have to check, if all accepted jobs can<br />
still meet their deadl<strong>in</strong>e<br />
l� For each sporadic job S k which has an equal or later<br />
deadl<strong>in</strong>e the S i we have to check, if the slack σ s,k is<br />
larger than the execution time of the new sporadic<br />
job e s,i<br />
l� The new sporadic job is only accepted, if this is the<br />
case for all accepted sporadic jobs<br />
IL2212 Embedded Software 48<br />
24
Change language