| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 420.12 KB | Adobe PDF |
Advisor(s)
Abstract(s)
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.
Description
Keywords
Constraint Programming Real-Time Parallel Tasks Distributed Multi-core Architectures