Solving a real-time allocation problem with constraint programming

Journal of Systems and Software

Volumn 81, Issue 1, 2008, Pages 132-149

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

^a UNIVERSITÉ DE NANTES   (France)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

Benders decomposition; Constraint programming; Fixed priority scheduling; Global constraint; Hard real time task allocation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; LEARNING SYSTEMS; SCHEDULING;

BENDERS DECOMPOSITION; CONSTRAINT PROGRAMING; FIXED PRIORITY SCHEDULING; GLOBAL CONSTRAINT; HARD REAL-TIME TASK ALLOCATION;

PROBLEM SOLVING;

EID: 35848947448     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2007.02.032     Document Type: Article

References (66)

1. Abdelzaher T.F., and Shin K.G. Period-based partitioning and assignment for large real-time applications. IEEE Transactions on Computers 49 1 (2000) 81-87
2. Aguilar J., and Gelenbe E. Task assignment and transaction clustering heuristics for distributed systems. Information Sciences 97 2 (1997) 199-219
3. Ali, S., Kim, J.-K., Siegel, H., Maciejewski, A., Yu, Y., Gundala, S., Gertphol, S., Prasanna, V., 2002. Greedy heuristic for resource allocation in dynamic distributed real-time heterogeneous computing systems. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2002), vol. 29.
4. Altenbernd P., and Hansson H. The slack method: a new method for static allocation of hard real-time tasks. Real-Time Systems 15 2 (1998) 103-130
5. Audsley N., Burns A., Richardson M., Tindell K., and Wellings A.J. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal (1993) 284-292
6. Baccouche, L. Un Mécanisme d'Ordonnancement Distribué de Tâches Temps Réel. Ph.D. Thesis, Institut National Polytechnique de Grenoble, 1995.
7. Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 (1962) 238-252
8. Benoist T., Gaudin E., and Rottembourg B. Constraint programming contribution to Benders decomposition: a case study. Lecture Notes in Computer Science 2470 (2002) 603-617
9. Bini E., and Buttazzo G. Measuring the performance of schedulability tests. Real-Time Systems 30 (2005) 129-154
10. Bosch, 1991. CAN Specification version 2.0.
11. Burns, A., Nicholson, M., Tindell, K., Zhang, N., 1993. Allocating and scheduling hard real-time task on a point-to-point distributed system. In: Proceedings of the Workshop on Parallel and Distributed Real-Time Systems, pp. 11-20.
12. Cambazard, H., Hladik, P.-E., Déplanche, A.-M., Jussien, N., Trinquet, Y., 2004. Decomposition and learning for a hard real-time task allocating problem. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004).
13. Cambazard, H., Hladik, P.E., Œdipe. http://oedipe.rts-software.org/index.php.
14. Coli, M., Palazzari, P., 1995. A new method for optimisation of allocation and scheduling in real-time applications. In: Proceedings of the 7th Euromicro Workshop on Real-Time Systems, pp. 262-269.
15. DiNatale, M., Stankovic, J.A., 1995. Applying of simulated annealing methods to real-time scheduling and jitter control. In: Proceedings of the 16th IEEE Real-Time Systems Symposium (RTSS 1995).
16. Ekelin, C. 2004. An optimization framework for scheduling of embedded real-time systems. Ph.D. Thesis, Chalmers University of Technology.
17. Elsadek A.A., and Wells B.E. A heuristic model for task allocation in heterogeneous distributed computing systems. The International Journal of Computers and their Applications 6 1 (1999)
18. Ercal F., Ramanujan J., and Sadayappan P. Task allocation on a hyper-cube by recursive bipartitioning. Journal of Parallel and Distributed Computing 10 (1990) 35-44
19. Ferro, E., Cayssials, R., Orozco, J., 1999. Tuning the cost function in a genetic/heuristic approach to the hard real-time multitask-multiprocessor assignment problem. In: Proceedings of the 3th World Multiconference on Systemics Cybernetics and Informatics, pp. 575-577.
20. Ferro, E., Sanchez, D., Cayssials, R., Orozco, J., 2000. New scheduling and assignment real time control task with precedence and deadline constraint in distributed control systems. citeseer.ist.psu.edu/405977.html.
21. Fredriksson, J., Sandström, K., Åkerholm, M., 2005. Optimizing resource usage in component-based real-time systems. In: Proceedings of the 8th International Symposium on Component-based Software Engineering (CBSE8).
22. Goossens, J., Macq, C., 2001. Limitation of the hyper-period in real-time periodic task set generation. In: Proceedings of the RTS Embedded System (RTS'01), pp. 133-147.
23. Hladik, P.-E., Cambazard, H., Déplanche, A.-M., Jussien, N., 2005. Dynamic constraint programming for solving hard real-time allocation problems. Technical Report 7, IRCCyN.
24. Hladik, P.-E., Cambazard, H., Déplanche, A.-M., Jussien, N., 2005. How to solve allocation problems with constraint programming. In: Proceedings of the Work In Progress of the 17th Euromicro, Palma de Mallorca, Balearic Islands, Spain, July 2005, pp. 25-28.
25. Hladik, P.-E., Déplanche, A.-M., 2005. Extension au réseau can des problèmes de placement. Technical Report 4, IRCCyN.
26. Hooker J., Ottosson G., Thorsteinsson E., and Kim H. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review 15 1 (2000) 11-30
27. Hooker J.N., and Ottoson G. Logic-based Benders decomposition. Mathematical Programming 96 (2003) 33-60
28. Jain V., and Grossmann I.E. Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing 13 (2001) 258-276
29. Junker, U., 2001. Quickxplain: conflict detection for arbitrary constraint propagation algorithms. In: Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI 01).
30. Narendra Jussien, 2003. The versatility of using explanations within constraint programming. Habilitation thesis of Université de Nantes.
31. Choco. http://choco.sourceforge.net/.
32. Koziris, N., Romesis, M., Tsanakas, P., Papakonstantinou, G., 2000. An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures. In: Proceedings of the 8th EuroPDP, pp. 406-413.
33. Laburthe, F., 2000. Choco: implementing a cp kernel. In: Proceedings of CP 00 Post Conference Workshop on Techniques for Implementing Constraint Programming Systems.
34. Lawler E. Recent results in the theory of machine scheduling. Mathematical Programming: The State of the Art (1983)
35. Lehoczky, J.P., 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11th IEEE Real-Time Systems Symposium (RTSS 1990), pp. 201-209.
36. Lepère, R., Trystram, D., 2002. A new clustering algorithm for scheduling task graphs with large communication delays. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002).
37. Leung J.Y.-T., and Whitehead J. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 22 (1982) 237-250
38. Lo V. Heuristic algorithms for task assignment in distributed systems. IEEE Transactions on Computers 37 11 (1988) 1384-1397
39. Monnier, Y., Beauvais, J.-P., Déplanche, A.-M., 1998. A genetic algorithm for scheduling tasks in a real-time distributed system. In: Proceedings of the 24th Euromicro Conference.
40. Muntean, T., Talbi, E-G., 1993. Hill-climbing, simulated annealing and genetic algorithms, a comparative study. In: Proceedings of the 26th Hawaii International Conference on Task Scheduling in Parallel and Distributed Systems (HICSS-26).
41. Mutka M., and Li J.-P. A tool for allocating periodic real-time tasks to a set of processors. The Journal of Systems and Software 29 2 (1995) 135-164
42. Oh, J., Bahn, H., Wu, C., Koh, K., 2000. Pareto-based soft real-time task scheduling in multiprocessor systems. In: Proceedings of the Seventh Asia-Pacific Software Engineering Conference (APSEC'00), pp. 24-28.
43. OSEK Group. OSEK/VDX Communication version 3.0.2.
44. Park H.-J., and Kim B. An optimal scheduling algorithm for minimizing the computing period of cyclic synchronous tasks on multiprocessors. The Journal of Systems and Software 56 (2001) 213-229
45. Peng D.-T., Shin K., and Abdelzaher T. Assignment and scheduling communicating periodic tasks in distributed real-time systems. IEEE Transactions on Software Engineering 23 12 (1997)
46. Porto S.C.S., and Ribeiro C.C. A tabu search approach to task scheduling on heterogeneous processors under precedence constraints. International Journal of High-Speed Computing 7 2 (1993)
47. Ramamritham, K., 1990. Allocation and scheduling of complex periodic tasks. In: Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS 1990).
48. Refalo, P., 2004. Impact-based search strategies for constraint programming. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004).
49. Régin J.C. Constraints and Integer Programming Combined, chapter Global Constraints and Filtering Algorithms (2003), Kluwer
50. Richard, M., Richard, P., Cottet, F., 2003. Allocating and scheduling tasks in multiple fieldbus real-time systems. In: Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation (ETFA), vol. 16, pp. 137-144.
51. Richaud, G., Cambazard, H., O'Sullivan, B., Jussien, N., 2006. Automata for nogood recording in constraint satisfaction problems. In: CP06 Workshop on the Integration of SAT and CP techniques, Nantes, France, September.
52. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier
53. Sandnes, F., 1996. A hybrid genetic algorithm applied to automatic parallel controller code generation. In: Proceedings of the 8th Euromicro Workshop on Real-Time Systems, pp. 70-75.
54. Santos J., Ferro E., Orozco J., and Cassials R. A heuristic approach to multitask-multiprocessing assignment problem using the empty-slots method and rate monotonic scheduling. Real-Time Systems 13 2 (1997) 167-199
55. Schild K., and Würtz J. Scheduling of time-triggered real-time systems. Constraints 5 4 (2000) 335-357
56. Silva, M., Cardeira, C., Mammeri, Z., 1997. Solving real-time scheduling problems with hopfield-type neural networks. In: Proceedings of the Euromicro Conference, pp. 671-678.
57. Stone H. Multiprocessor scheduling the aid of network flow algorithms. IEEE Transactions on Software Engineering 3 1 (1997) 85-93
58. Szymanek, R., Gruian, F., Kuchcinski, K., 2000. Digital systems design using constraint logic programming. In: Proceedings of the Practical Application of Constraint Technologies and Logic Programming (PACLP 2000).
59. Szymanek, R., Kuchcinski, K., 2003. Partial task assignment of task graphs under heterogeneous resource constraints. In: Proceedings of the 40th conference on Design Automation (DAC '03), pp. 244-249.
60. Talbi, E-G., Muntean, T., 1993. General heuristics for the mapping problem. In: Proceedings of the World Transputer Conference.
61. Thorsteinsson E.S. Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. Lecture Notes in Computer Science 2239 (2001)
62. Tindell, K., Hansson, H., Wellings, A., 1994. Analysis real-time communications: controller area network (CAN). In: Proceedings of the 15th IEEE Real-Time Systems Symposium (RTSS 1994), pp. 259-265.
63. Tindell K.W., Burns A., and Wellings A. Allocating hard real-time tasks: An np-hard problem made easy. Real-Time Systems 4 2 (1992) 145-165
64. Vargas, L., Olivaira, R., 2005. Empirical study of tabu search, simulated annealing and multi-start in fieldbus scheduling. In: Proceedings of the 10th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2005), vol. 1, pp. 101-108.
65. Wang, S., Merrick, J., Shin, K., 2004. Component allocation with multiple resource constraints for large embedded real-time software design. In: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'04).
66. Wong, C., Thoen, F., Catthoor, K., Verkest, D., 2000. Requirements for static task scheduling in real-time embedded systems. In: Proceedings of the 3rd Workshop on System Design Automation (SDA 2000), pp. 23-30.