Name
Abstract | ||
|---|---|---|
Historically safety-critical real-time systems have been implemented using a cyclic executive (CE). Here a series of frames (minor cycles) are executed in sequence. Once the series is complete the sequence is repeated. The duration of the full sequence is often known as the major cycle. Within each frame, units of computation (jobs) are executed, again in sequence. Although there are a number of drawbacks to the use of CEs they have the advantage of being fully deterministic and efficiently implemented. For multi-core platforms, running a set of frames on each core is an obvious extension to the single core approach. Here there is advantage in coordinating the execution of the cores so that frames are released at the same time across all cores. For mixed criticality systems, the requirement for separation would imply that, at any time, code of the same criticality must execute on all cores. In this paper we consider how this requirement can be met and the performance, in terms of schedulability, it delivers. We consider partitioned and globally allocated work. For partitioned systems an allocation scheme is developed. For globally scheduled schemes we develop a polynomial-time sufficient schedulability test that determines whether a given mixed-criticality system is schedulable, and constructs a schedule if it is. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ECRTS.2015.8 | Euromicro Conference on Real-Time Systems |
Keywords | Field | DocType |
Mixed Criticality Systems,Real-time Systems,Cyclic Executives | Resource management,Single-core,Computer science,Parallel computing,Mixed criticality,Real-time computing,Schedule,Criticality,Cyclic executive,Multi-core processor,Distributed computing,Computation | Conference |
ISSN | Citations | PageRank |
1068-3070 | 8 | 0.48 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan Burns | 1 | 739 | 59.60 |
| T. Fleming | 2 | 8 | 0.48 |
| Sanjoy K. Baruah | 3 | 4664 | 374.79 |