Scheduling Conditional Task Graphs

This paper describes a complete and efficient solution to the scheduling of conditional task graphs whose nodes are activities and whose arcs can be labelled with a probability distribution. Tasks are executed if a set of conditions hold at scheduling execution time. The model is therefore stochastic. The minimization of the expected makespan implies an exponential-sized description of the objective function. We propose an analytic formulation of the stochastic objective function based on the task graph analysis, and a conditional constraint that handles it efficiently. Experimental results show the effectiveness of our approach in comparison with (1) an approach using a deterministic objective function and (2) scenario based constraint programming taking into account all scenarios or only a part of them.

[1]  Petru Eles,et al.  Scheduling and mapping of conditional task graph for the synthesis of low power embedded systems , 2003 .

[2]  Toby Walsh,et al.  Stochastic Constraint Programming , 2002, ECAI.

[3]  Thierry Vidal,et al.  Handling contingency in temporal constraint networks: from consistency to controllabilities , 1999, J. Exp. Theor. Artif. Intell..

[4]  Paolo Faraboschi,et al.  Instruction scheduling for instruction level parallel processors , 2001, Proc. IEEE.

[5]  Dongkun Shin,et al.  Power-aware scheduling of conditional task graphs in real-time multiprocessor systems , 2003, Proceedings of the 2003 International Symposium on Low Power Electronics and Design, 2003. ISLPED '03..

[6]  J. Christopher Beck,et al.  Proactive Algorithms for Scheduling with Probabilistic Durations , 2005, IJCAI.

[7]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[8]  Luca Benini,et al.  Allocation and Scheduling for MPSoCs via decomposition and no-good generation , 2005, IJCAI.

[9]  Krzysztof Kuchcinski,et al.  Constraints-driven scheduling and resource assignment , 2003, TODE.

[10]  Yuan Xie,et al.  Allocation and scheduling of conditional task graph in hardware/software co-synthesis , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[11]  Dongkun Shin,et al.  Power-aware scheduling of conditional task graphs in real-time multiprocessor systems , 2003, ISLPED '03.

[12]  Mark Abramson,et al.  Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[13]  J. Christopher Beck,et al.  Scheduling Alternative Activities , 1999, AAAI/IAAI.

[14]  Gürhan Küçük,et al.  Reducing reorder buffer complexity through selective operand caching , 2003, ISLPED '03.

[15]  Roman Barták,et al.  Temporal Networks with Alternatives: Complexity and Model , 2007, FLAIRS.

[16]  Toby Walsh,et al.  Stochastic Constraint Programming: A Scenario-Based Approach , 2009, Constraints.

[17]  Thierry Vidal,et al.  CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning , 2003, Constraints.

[18]  Michele Lombardi,et al.  Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs , 2006, CP.

[19]  Petru Eles,et al.  Scheduling and mapping of conditional task graphs for the synthesis of low power embedded systems , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.