Abstract
Many real world cyclic scheduling problems involve applications that need to be repeated with different periodicity. For example, multirate control systems present multiple control loops that are organized hierarchically: the higher-level loop responds to the slower system dynamics and typically its period can be a few orders of magnitude longer than the lowest level. Cyclic scheduling problems can be cast into classical RCPSP instances via a technique called unfolding [4, 6], which causes graph expansion. In the case of multirate applications, this expansion can be significantly large. In this context, finding a high-quality allocation and schedule could be very challenging. In this paper, we propose a new Multirate Resource Constraint, modeling unary resources, that avoids graph expansion by exploiting the multirate nature of the schedule in its filtering algorithm. In an experimentation on synthetic and real-world instances, we show that our method drastically outperforms approaches based on state-of-the-art unfolding and constraint based scheduling.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In the whole paper we assume that the durations and the periods are positive values.
- 2.
The generator and the synthetic instances solved in this work can be found at https://github.com/alessioBonfietti/Multirate-Resource-Constraint-Repo.
- 3.
The time limit value refers to the limit we use for the subproblem of the last application (the hardest). The previous subproblems were solved with a time limit halved at each step (e.g. if we have three applications, the limits would be 75,150,300, respectively).
References
Baptiste, P., Le Pape, C., Nuijten, W.: Constrains-Based Scheduling: Applying Constraint Programming to Scheduling. Springer, New York (2001)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling. Springer, New York (2001)
Beldiceanu, N., Carlsson, M., Thiel, S.: Sweep synchronization as a global propagation mechanism. Comput. Oper. Res. 33(10), 2835–2851 (2006)
Shuvra, S., Bhattacharyya, S.S.: Embedded Multiprocessors - Scheduling and Synchronization. Signal Processing and Communications, 2nd edn. CRC Press, Boca Raton (2009)
Bonfietti, A., Lombardi, M., Benini, L., Milano, M.: Cross cyclic resource-constrained scheduling solver. Artif. Intell. 206, 25–52 (2014)
Bonfietti, A., Lombardi, M., Milano, M.: De-cycling cyclic scheduling problems. In: Twenty-Third International Conference on Automated Planning and Scheduling (2013)
de Dinechin, B.D., Kordon, A.M.: Converging to periodic schedules for cyclic scheduling problems with resources and deadlines. Comput. Oper. Res. 51, 227–236 (2014)
Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15–17, 2008, Coconut Grove, Florida, USA, pp. 555–560 (2008)
Laborie, P., Rogerie, J., Shaw, P., Vilím, P.: Reasoning with conditional time-intervals. part II: an algebraical model for resources. In: Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, May 19–21, 2009, Sanibel Island, Florida, USA (2009)
Le Pape, C., Couronné, P., Vergamini, D., Gosselin, V.: Time-versus-capacity compromises in project scheduling. AISB QUARTERLY, p. 19 (1995)
Letort, A., Beldiceanu, N., Carlsson, M.: A scalable sweep algorithm. In: Proceedings of CP, pp. 439–454 (2012)
Li, Y., Wolf, W.: Hierarchical scheduling and allocation of multirate systems on heterogeneous multiprocessors. In: Proceedings of ED&TC, pp. 134–139 (1997)
Mercier, L., Van Hentenryck, P.: Edge finding for cumulative scheduling. INFORMS J. Comput. 20(1), 143–153 (2008)
Google ortools. https://developers.google.com/optimization/
Vilim, P.: O(n log n) filtering algorithms for unary resource constraint. In: Proceedings of CPAIOR, pp. 335–347 (2004)
Yi, Y., Milward, M., Khawam, S., Nousias, L., Arslan, T.: Automatic synthesis and scheduling of multirate DSP algorithms. In: Proceedings of ASP-DAC, pp. 635–638 (2005)
Zhu, X.-Y., Basten, T., Geilen, M., Stuijk, S.: Efficient retiming of multirate DSP algorithms. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 31(6), 831–844 (2012)
Zhu, X.-Y., Geilen, M., Basten, T., Stuijk, S.: Static rate-optimal scheduling of multirate DSP algorithms via retiming and unfolding. In: 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium, pp. 109–118. IEEE, April 2012
Acknowledgements
We would like to show our gratitude to William Aeby for his assistance in extracting the industrial instances.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bonfietti, A., Zanarini, A., Lombardi, M., Milano, M. (2016). The Multirate Resource Constraint. In: Rueher, M. (eds) Principles and Practice of Constraint Programming. CP 2016. Lecture Notes in Computer Science(), vol 9892. Springer, Cham. https://doi.org/10.1007/978-3-319-44953-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-44953-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44952-4
Online ISBN: 978-3-319-44953-1
eBook Packages: Computer ScienceComputer Science (R0)