Abstract
In a cyclic executive, a series of pre-determined frames are
executed in sequence; once the series is complete the sequence is repeated.
Within each frame individual units of computation are executed, again in
a pre-specified sequence. The implementation of cyclic executives upon
multi-core platforms is considered. A Linear Programming (LP) based
formulation is presented of the problem of constructing cyclic executives
upon multiprocessors for a particular kind of recurrent real-time
workload – collections of implicit-deadline periodic tasks. Techniques are
described for solving the LP formulation under different kinds of restrictions
in order to obtain preemptive and non-preemptive cyclic executives.
executed in sequence; once the series is complete the sequence is repeated.
Within each frame individual units of computation are executed, again in
a pre-specified sequence. The implementation of cyclic executives upon
multi-core platforms is considered. A Linear Programming (LP) based
formulation is presented of the problem of constructing cyclic executives
upon multiprocessors for a particular kind of recurrent real-time
workload – collections of implicit-deadline periodic tasks. Techniques are
described for solving the LP formulation under different kinds of restrictions
in order to obtain preemptive and non-preemptive cyclic executives.
Original language | English |
---|---|
Pages | 94-109 |
Number of pages | 16 |
Publication status | Published - Oct 2017 |
Event | Dependable Software Engineering Theories, Tools and Application - Changsha, China Duration: 23 Oct 2017 → 25 Oct 2017 |
Conference
Conference | Dependable Software Engineering Theories, Tools and Application |
---|---|
Abbreviated title | SETTA |
Country/Territory | China |
City | Changsha |
Period | 23/10/17 → 25/10/17 |