Decomposition and learning for a hard real time task allocation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 153-167

  Cambazard, Hadrien ^a   Hladik, Pierre Emmanuel ^b   Déplanche, Anne Marie ^b   Jussien, Narendra ^a   Trinquet, Yvon ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCHEDULING;

COMPUTATION ALGORITHM; CONSTRAINT PROGRAMMING; FIXED PRIORITIES; HARD REAL-TIME TASK; LOGIC-BASED BENDERS DECOMPOSITIONS; MASTER PROBLEMS; PRE-EMPTIVE SCHEDULING; SCHEDULABILITY ANALYSIS;

REAL TIME SYSTEMS;

EID: 35048904144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_14     Document Type: Article

References (23)

1. Peter Altenbernd and Hans Hansson. The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks. Real-Time Systems, 15:103-130, 1998.
2. J. F. Benders. Partitionning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238-252, 1962.
3. T. Benoist, E. Gaudin, and B. Rottembourg. Constraint programming contribution to benders decomposition: A case study. In CP'02, pages 603-617, 2002.
4. G. Borriello and D. Miles. Task Scheduling for Real-Time Multiprocessor Simulations. 11th Workshop on RTOSS, pages 70-73, 1994.
5. Coen Bron and Joep Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16(9):575-577, 1973.
6. E. Ferro, R. Cayssials, and J. Orozco. Tuning the Cost Function in a Genetic/Heuristic Approach to the Hard Real-Time Multitask-Multiprocessor Assignment Problem. Proceeding of the Third World Multiconference on Systemics Cybernetics and Informatics, pages 143-147, 1999.
7. M. González Harbour, M.H. Klein, and J.P. Lehoczky. Fixed Priority Scheduling of Periodic Tasks with Varying Execution Priority. Proceeding of the IEEE Real-Time Systelms Symposium, pages 116-128, December 1991.
8. J.N. Hooker and G. Ottosson. Logic-based benders decomposition. Mathematical Programming, 96:33-60, 2003.
9. J.N. Hooker, G. Ottosson, E. S. Thorsteinsson, and H. Kim. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review, special issue on AI/OR, 15(1):11-30, 2000.
10. Vipul Jain and I. E. Grossmann. Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing, 13:258-276, 2001.
11. Ulrich Junker. Quickxplain: Conflict detection for arbitrary constraint propagation algorithms. In IJCAI'01 Workshop on Modelling and Solving problems with constraints (CONS-1), Seattle, WA, USA, August 2001.
12. Narendra Jussien. The versatility of using explanations within constraint programming. RR 03-04-INFO, École des Mines de Nantes, France, 2003.
13. Narendra Jussien and Olivier Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1):21-45, July 2002.
14. E. L. Lawler. Recent Results in the Theory of Machine Scheduling. Mathematical Programming: The State of the Art, pages 202-233, 1983.
15. C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real Time Environment. Journal ACM, 20(1):46-61, 1973.
16. Y. Monnier, J.-P. Beauvais, and A.-M. Déplanche. A Genetic Algorithm for Scheduling Tasks in a Real-Time Distributed System. 24th Euromicro Conference, 2, 1998.
17. K. Ramamritham. Allocation and Scheduling of Complex Periodic Tasks. 10th International Conference on Distributed Computing Systems, pages 108-115, 1990.
18. J.C. Régin. Generalized arc consistency for global cardinality constraint. AAAI / IAAI, pages 209-215, 1996.
19. F. E. Sandnes. A hybrid genetic algorithm applied to automatic parallel controller code generation. 8th IEEE Euromicro Workshop on Real-Time Systems, 1996.
20. Thomas Schiex and Gérard Verfaillie. Nogood recording for static and dynamic constraint satisfaction problem. IJAIT, 3(2):187-207, 1994.
21. Erlendur S. Thorsteinsson. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In CP'01, 2001.
22. K. Tindell, A. Burns, and A. Wellings. Allocation Hard Real-Time tasks: An NP-Hard Problem Made Easy. The Journal of Real-Time Systems, 4(2):145-165, 1992.
23. K. Tindell and J. Clark. Holistic scheduling Analysis for Distributed Hard Real-Time Systems. Euromicro Journal, pages 40-117, 1994.