RTSAT-- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures

Metzner, Alexander; Herde, Christian

doi:10.1109/rtss.2006.44

Cited by 44 publications

(38 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [3] the authors propose to solve the problem of allocation of tasks by formulating a mixed integer linear programming framework. Similarly to this work, in [4], the authors model the task partitioning problem as a constraint optimization programming problem. Both works assume that each thread has its own period and deadline.…”

Section: Related Workmentioning

confidence: 99%

“…In this section we analyze the system requirements and provide a formulation based on a constraint programming approach similar to [4].…”

Section: Constraint Programming Formulationmentioning

confidence: 99%

“…This implies the use of extremely powerful optimization methods. It has been shown (e.g., [4]) that such type of optimization problems are not amenable for conventional numerical optimization solvers. However, for real-time purposes, a correct solution is obtained by guaranteeing that all the constraints are satisfied, regardless of the value of a given objective function.…”

Section: Constraint Satisfiabilitymentioning

confidence: 99%

“…However, for real-time purposes, a correct solution is obtained by guaranteeing that all the constraints are satisfied, regardless of the value of a given objective function. Thus, the optimization problem gets reduced to a Satisfiability (SAT) problem, in which solutions can be obtained in reasonable time [4]. The constrains and optimization variables are summarized in the following.…”

Section: Constraint Satisfiabilitymentioning

confidence: 99%

“…Our constraint programming formulation is guaranteed to find a feasible allocation, if one exists, in contrast to other approaches based on heuristic techniques. Our work is close to the one presented in [4], but with the main difference: (i) that we model forkjoin Parallel/Distributed real-time tasks executing over a distributed multi-core architecture, and (ii) that we consider messages being transmitted through a Flexible Time Triggered Switched Ethernet (FTT-SE) network. Furthermore, similar approaches based on constraint programming have shown that it is possible to obtain solutions for these type of formulations in reasonable time [3,4].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network

Garibay-Martínez¹,

Nelissen²,

Ferreira³

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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

show abstract

Section: Related Workmentioning

confidence: 99%

“…In this section we analyze the system requirements and provide a formulation based on a constraint programming approach similar to [4].…”

Section: Constraint Programming Formulationmentioning

confidence: 99%

Section: Constraint Satisfiabilitymentioning

confidence: 99%

Section: Constraint Satisfiabilitymentioning

confidence: 99%