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 :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01250010
Contributor : Team Kairos <>
Submitted on : Monday, January 4, 2016 - 11:24:28 AM
Last modification on : Thursday, July 25, 2019 - 4:34:16 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

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. 13th International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2015, Madrid, Spain. ⟨10.1007/978-3-319-22975-1_8⟩. ⟨hal-01250010⟩

Share

Metrics

Record views

432

Files downloads

256