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

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

Standard

Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems. / Tamas-Selicean, Domitian; Pop, Paul.

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE, 2012.

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

Harvard

Tamas-Selicean, D & Pop, P 2012, 'Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems'. in 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE., 10.1109/PRDC.2011.42

APA

Tamas-Selicean, D., & Pop, P. (2012). Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems. In 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE. 10.1109/PRDC.2011.42

CBE

Tamas-Selicean D, Pop P. 2012. Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems. In 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE. Available from: 10.1109/PRDC.2011.42

MLA

Tamas-Selicean, Domitian and Paul Pop "Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems". 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE. 2012. Available: 10.1109/PRDC.2011.42

Vancouver

Tamas-Selicean D, Pop P. Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems. In 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE. 2012. Available from: 10.1109/PRDC.2011.42

Author

Tamas-Selicean, Domitian; Pop, Paul / Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems.

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE, 2012.

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

Bibtex

@inbook{fe7b2f6f12604ac49708e80a02876908,
title = "Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems",
publisher = "IEEE",
author = "Domitian Tamas-Selicean and Paul Pop",
year = "2012",
doi = "10.1109/PRDC.2011.42",
isbn = "978-1-4577-2005-5",
booktitle = "2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC)",

}

RIS

TY - GEN

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

A1 - Tamas-Selicean,Domitian

A1 - Pop,Paul

AU - Tamas-Selicean,Domitian

AU - Pop,Paul

PB - IEEE

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://prdc.dependability.org/2011/

U2 - 10.1109/PRDC.2011.42

DO - 10.1109/PRDC.2011.42

SN - 978-1-4577-2005-5

BT - 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC)

T2 - 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC)

ER -