Abstract
We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in the context of fixed priorities preemptive scheduling. The problem is to be solved off-line and our solving strategy is related to the logic based Benders decomposition. A master problem is solved using constraint programming whereas subproblems are solved with schedulability analysis techniques coupled with an ad hoc nogood computation algorithm. Constraints and nogoods are learnt during the process and play a role close to Benders cuts.
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
Altenbernd, P., Hansson, H.: The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks. Real-Time Systems 15, 103–130 (1998)
Benders, J.F.: Partitionning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962)
Benoist, T., Gaudin, E., Rottembourg, B.: Constraint programming contribution to benders decomposition: A case study. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 603–617. Springer, Heidelberg (2002)
Borriello, G., Miles, D.: Task Scheduling for Real-Time Multiprocessor Simulations. In: 11th Workshop on RTOSS, pp. 70–73 (1994)
Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)
Ferro, E., Cayssials, R., Orozco, J.: Tuning the Cost Function in a Genetic/ Heuristic Approach to the Hard Real-Time Multitask-Multiprocessor Assignment Problem. In: Proceeding of the Third World Multiconference on Systemics Cybernetics and Informatics, pp. 143–147 (1999)
González Harbour, M., Klein, M.H., Lehoczky, J.P.: Fixed Priority Scheduling of Periodic Tasks with Varying Execution Priority. In: Proceeding of the IEEE Real-Time Systelms Symposium, December 1991, pp. 116–128 (1991)
Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming 96, 33–60 (2003)
Hooker, J.N., Ottosson, G., Thorsteinsson, E.S., Kim, H.: A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review, special issue on AI/OR 15(1), 11–30 (2000)
Jain, V., Grossmann, I.E.: Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing 13, 258–276 (2001)
Junker, U.: Quickxplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI 2001 Workshop on Modelling and Solving problems with constraints (CONS-1), Seattle, WA, USA (August 2001)
Jussien, N.: The versatility of using explanations within constraint programming. RR 03-04-INFO, École des Mines de Nantes, France (2003)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139(1), 21–45 (2002)
Lawler, E.L.: Recent Results in the Theory of Machine Scheduling. In: Mathematical Programming: The State of the Art, pp. 202–233 (1983)
Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard-Real Time Environment. Journal ACM 20(1), 46–61 (1973)
Monnier, Y., Beauvais, J.-P., Déplanche, A.-M.: A Genetic Algorithm for Scheduling Tasks in a Real-Time Distributed System. In: 24th Euromicro Conference, vol. 2 (1998)
Ramamritham, K.: Allocation and Scheduling of Complex Periodic Tasks. In: 10th International Conference on Distributed Computing Systems, pp. 108–115 (1990)
Régin, J.C.: Generalized arc consistency for global cardinality constraint. In: AAAI / IAAI, pp. 209–215 (1996)
Sandnes, F.E.: A hybrid genetic algorithm applied to automatic parallel controller code generation. In: 8th IEEE Euromicro Workshop on Real-Time Systems (1996)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problem. IJAIT 3(2), 187–207 (1994)
Thorsteinsson, E.S.: Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 16. Springer, Heidelberg (2001)
Tindell, K., Burns, A., Wellings, A.: Allocation Hard Real-Time tasks: An NP-Hard Problem Made Easy. The Journal of Real-Time Systems 4(2), 145–165 (1992)
Tindell, K., Clark, J.: Holistic scheduling Analysis for Distributed Hard Real-Time Systems. Euromicro Journal, 40–117 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cambazard, H., Hladik, PE., Déplanche, AM., Jussien, N., Trinquet, Y. (2004). Decomposition and Learning for a Hard Real Time Task Allocation Problem. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive