Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

View graph of relations

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.
Original languageEnglish
Title of host publication2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC)
Publication date2012
ISBN (print)978-1-4577-2005-5
ISBN (electronic)978-0-7695-4590-5
StatePublished - 2012
Event17th IEEE Pacific Rim International Symposium on Dependable Computing - Pasadena, United States


Conference17th IEEE Pacific Rim International Symposium on Dependable Computing
CountryUnited States
Internet address
CitationsWeb of Science® Times Cited: 2
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

Download statistics

No data available

ID: 6600086