TY - GEN
T1 - Allocation of parallel real-time tasks in distributed multi-core architectures supported by an FTT-SE network
AU - Garibay-Martínez, Ricardo
AU - Nelissen, Geoffrey
AU - Ferreira, Luis Lino
AU - Pinho, Luís Miguel
PY - 2015/1/1
Y1 - 2015/1/1
N2 - Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network.We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.
AB - Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network.We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.
KW - Constraint programming
KW - Distributed multi-core architectures
KW - Parallel tasks
KW - Real-time
UR - http://www.scopus.com/inward/record.url?scp=84930453736&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-16086-3_18
DO - 10.1007/978-3-319-16086-3_18
M3 - Conference contribution
AN - SCOPUS:84930453736
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 224
EP - 235
BT - Architecture of Computing Systems - ARCS 2015 - 28th International Conference, Proceedings
A2 - Pinho, Luís Miguel
A2 - Karl, Wolfgang
A2 - Brinkschulte, Uwe
A2 - Cohen, Albert
PB - Springer
T2 - 28th International Conference on Architecture of Computing Systems, ARCS 2015
Y2 - 24 March 2015 through 27 March 2015
ER -