Conference paper
Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems
In this paper we address the mapping of mixedcriticality hard real-time applications on distributed embedded architectures. We assume that the architecture provides both spatial and temporal partitioning, thus enforcing enough separation between applications. With temporal partitioning, each application runs in a separate partition, and each partition is allocated several time slots on the processors where the application is mapped.
The sequence of time slots for all the applications on a processor are grouped within a Major Frame, which is repeated periodically. We assume that the applications are scheduled using static-cyclic scheduling. We are interested to determine the task mapping to processors, and the sequence and size of the time slots within the Major Frame on each processor, such that the applications are schedulable.
We have proposed a Tabu Search-based approach to solve this optimization problem. The proposed algorithm has been evaluated using several synthetic and real-life benchmarks.
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 2012 |
| Pages: | 282-283 |
| Proceedings: | 17th IEEE Pacific Rim International Symposium on Dependable Computing |
| ISBN: | 0769545904 , 1457720051 , 9780769545905 and 9781457720055 |
| Types: | Conference paper |
| DOI: | 10.1109/PRDC.2011.42 |
| ORCIDs: | Pop, Paul |
Aerospace electronics Benchmark testing Computer architecture Optimization Program processors Real time systems Schedules distributed embedded architectures distributed processing embedded embedded systems major frame mapping mixed-criticality mixed-criticality hard real-time applications mixed-criticality real-time systems optimization problem partition allocation partitioning real-time scheduling search problems spatial partitioning static-cyclic scheduling tabu search-based approach task mapping temporal partitioning
