Solving a real-time allocation problem with constraint programmingReport as inadecuate

Solving a real-time allocation problem with constraint programming - Download this document for free, or read online. Document in PDF available to download.

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

Abstract : 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.

Author: Pierre-Emmanuel Hladik - Hadrien Cambazard - Anne-Marie Déplanche - Narendra Jussien -



Related documents