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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bahn, J.H., Yang, J., Bagherzadeh, N.: Parallel fft algorithms on network-on-chips. In: Proceedings ITNG 2008, April 2008
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems, vol. 39. Springer Science & Business Media (2001)
Bini, E., Buttazzo, G.: Measuring the performance of schedulability tests. Real Time Systems 30, 129–154 (2005)
Carle, T., Potop-Butucaru, D.: Predicate-aware, makespan-preserving software pipelining of scheduling tables. TACO 11(1), 12 (2014)
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
Coffman Jr., A.P.E., Graham, R.L.: Optimal scheduling for two-processor systems. Acta informatica 1(3), 200–213 (1972)
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
Garey, M., Johnson, D.: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal of Computing 4(4), 397–411 (1975)
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 2007
Hang, C., Manolios, P., Papavasileiou, V.: Synthesizing cyber-physical architectural models with real-time constraints. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 441–456. Springer, Heidelberg (2011)
Leyton-Brown, K., Hoos, H.H., Hutter, F., Xu, L.: Understanding the empirical hardness of np-complete problems. Commun. ACM 57(5), 98–107 (2014). http://doi.acm.org/10.1145/2594413.2594424
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 2010
Nowatzki, T., Sartin-Tarm, M., Carli, L.D., Sankaralingam, K., Estan, C., Robatmili, B.: A general constraint-centric scheduling framework for spatial architectures. SIGPLAN Not. 48(6), 495–506 (2013). http://doi.acm.org/10.1145/2499370.2462163, (Proceedings PLDI 2013)
Tendulkar, P., Poplavko, P., Maler, O.: Symmetry breaking for multi-criteria mapping and scheduling on multicores. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 228–242. Springer, Heidelberg (2013)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gorcitz, R., Kofman, E., Carle, T., Potop-Butucaru, D., de Simone, R. (2015). On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling. In: Sankaranarayanan, S., Vicario, E. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2015. Lecture Notes in Computer Science(), vol 9268. Springer, Cham. https://doi.org/10.1007/978-3-319-22975-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-22975-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22974-4
Online ISBN: 978-3-319-22975-1
eBook Packages: Computer ScienceComputer Science (R0)