On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
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.
KeywordsReal-time scheduling Satisfiability modulo theories Constraint solving Repeatable
Unable to display preview. Download preview PDF.
- 1.Bahn, J.H., Yang, J., Bagherzadeh, N.: Parallel fft algorithms on network-on-chips. In: Proceedings ITNG 2008, April 2008Google Scholar
- 2.Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems, vol. 39. Springer Science & Business Media (2001)Google Scholar
- 5.Carle, T., Potop-Butucaru, D., Sorel, Y., Lesens, D.: From dataflow specification to multiprocessor partitioned time-triggered real-time implementation. Research Report RR-8109 (2012). https://hal.inria.fr/hal-00742908
- 7.Craciunas, S., Oliver, R.S.: SMT-based task- and network-level static schedule generation for time-triggered networked systems. In: Proceedings RTNS 2014. pp. 45:45–45:54. ACM, New York (2014). http://doi.acm.org/10.1145/2659787.2659812
- 9.Gu, Z., He, X., Yuan, M.: Optimization of static task and bus access schedules for time-triggered distributed embedded systems with model-checking. In: 44th ACM/IEEE Design Automation Conference, DAC 2007, pp. 294–299, June 2007Google Scholar
- 12.Megel, T., Sirdey, R., David, V.: Minimizing task preemptions and migrations in multiprocessor optimal real-time schedules. In: 2010 IEEE 31st Real-Time Systems Symposium (RTSS), pp. 37–46, November 2010Google Scholar