DMCA
Decomposition and learning for a hard real time task allocation algorithm (2004)
| Venue: | Principles and Practice of Constraint Programming (CP 2004), Lecture Notes in Computer Science 3258 |
| Citations: | 14 - 0 self |
BibTeX
@INPROCEEDINGS{Cambazard04decompositionand,
author = {Hadrien Cambazard and Pierre-emmanuel Hladik and Anne-marie Déplanche and Narendra Jussien},
title = {Decomposition and learning for a hard real time task allocation algorithm},
booktitle = {Principles and Practice of Constraint Programming (CP 2004), Lecture Notes in Computer Science 3258},
year = {2004},
pages = {153--167},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in the context of fixed priorities preemptive scheduling. The problem is to be solved off-line and our solving strategy is related to the logic based Benders decomposition. A master problem is solved using constraint programming whereas subproblems are solved with schedulability analysis techniques coupled with an ad hoc nogood computation algorithm. Constraints and nogoods are learnt during the process and play a role close to Benders cuts. 1
