Solving allocation problems of hard real-time systems with dynamic constraint programming

Pierre-Emmanuel Hladik (1) , Hadrien Cambazard (2, 3) , Anne-Marie Déplanche (1) , Narendra Jussien (4)

1 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
2 LINA - Laboratoire d'Informatique de Nantes Atlantique
3 Département informatique - EMN
4 TASC - Theory, Algorithms and Systems for Constraints

In this paper, we present an original approach (CPRTA for ”Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve an allocation problem of hard real-time tasks in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming together with a learning method to find a feasible processor allocation under constraints. It is a new approach which produce in its current version as acceptable performances as classical algorithms do. Some experimental results are given to show it. Moreover, CPRTA shows very interesting properties. It is complete —i.e., if a problem has no solution, the algorithm is able to prove it—, and it is non-parametric —i.e., it does not require specific initializations—. Thanks to its capacity to explain failures, it offers attractive perspectives for guiding the architectural design process.

Domaines: Génie logiciel [cs.SE]

Pierre-Emmanuel Hladik, Hadrien Cambazard, Anne-Marie Déplanche, Narendra Jussien. Solving allocation problems of hard real-time systems with dynamic constraint programming. 14th International Conference on Real-Time and Network Systems (RTNS'06), 2006, Poitiers, France, France. pp.214-223. ⟨hal-00483101⟩