Abstract
This paper presents a definition of a Ravenscar-like profile (EDF Ravenscar) that incorporates EDF scheduling. Rather than just replace the dispatching policy, an argument is made for simplifying the support that is provided in full Ada for controlling access to protected objects. As a result all tasks and protected objects have their default priorities, and only one ready queue is needed (ordered by absolute deadline). The paper also outlines the static scheduling analysis that can be applied to applications conforming to the profile.
Original language | Undefined/Unknown |
---|---|
Title of host publication | Proceeding of the 15th IRTAW |
Publisher | ACM |
Pages | 24-31 |
Number of pages | 8 |
Volume | XXXII |
Publication status | Published - 2013 |