835 articles – 1515 Notices  [english version]
HAL : hal-00293898, version 1

Fiche détaillée  Récupérer au format
Journal of Systems and Software 81, 1 (2007) 132-149
Solving a real-time allocation problem with constraint programming
Pierre-Emmanuel Hladik 1, Hadrien Cambazard 2, Anne-Marie Déplanche 1, Narendra Jussien 2
(2007)

In this paper, we present an original approach (CPRTA for "Constraint Programming for solving Real-Time Allocation") based on constraint programming to solve a static allocation problem of hard real-time tasks. This problem consists in assigning periodic tasks to distributed processors 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. Two efficient new approaches are proposed and validated with experimental results. Moreover, CPRTA exhibits very interesting properties. It is complete (if a problem has no solution, the algorithm is able to prove it); it is non-parametric (it does not require specific tuning) thus allowing a large diversity of models to be easily considered. Finally, thanks to its capacity to explain failures, it offers attractive perspectives for guiding the architectural design process.
1 :  Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN)
CNRS : UMR6597 – PRES Université Nantes Angers Le Mans [UNAM] – École Centrale de Nantes – École Nationale Supérieure des Mines - Nantes – Ecole Polytechnique de l'Université de Nantes
2 :  Laboratoire d'Informatique de Nantes Atlantique (LINA)
CNRS : FRE2729 – Université de Nantes – École Nationale Supérieure des Mines - Nantes
Informatique/Intelligence artificielle

Informatique/Recherche opérationnelle
Liste des fichiers attachés à ce document : 
PDF
hladik-JSS07.pdf(619.9 KB)