On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling

Abstract : Recent papers have reported on successful application of constraint solving techniques to off-line real-time scheduling problems, with realistic size and complexity. Success allegedly came for two reasons: major recent advances in solvers efficiency and use of optimized, problem-specific constraint representations. Our current objective is to assess further the range of applicability and the scalability of such constraint solving techniques based on a more general and agnostic evaluation campaign. For this, we have considered a large number of synthetic scheduling problems and a few real-life ones, and attempted to solve them using 3 state-of-the-art solvers, namely CPLEX, Yices2, and MiniZinc/G12. Our findings were that, for all problems considered, constraint solving does scale to a certain limit, then diverges rapidly. This limit greatly depends on the specificity of the scheduling problem type. All experimental data (synthetic task systems, SMT/ILP models) are provided so as to allow experimental reproducibility.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01179489
Contributor : Team Kairos <>
Submitted on : Wednesday, July 22, 2015 - 3:52:27 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Document(s) archivé(s) le : Friday, October 23, 2015 - 11:14:29 AM

File

preprint.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01179489, version 1

Collections

Relations

Citation

Raul Gorcitz, Emilien Kofman, Thomas Carle, Dumitru Potop-Butucaru, Robert de Simone. On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling. 2015. ⟨hal-01179489⟩

Share

Metrics

Record views

337

Files downloads

252