Journal
JOURNAL OF SYSTEMS AND SOFTWARE
Volume 81, Issue 1, Pages 132-149Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.jss.2007.02.032
Keywords
hard real-time task allocation; fixed priority scheduling; constraint programming; global constraint; benders decomposition
Ask authors/readers for more resources
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. (c) 2007 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available