Periodic Schedules for Linear Precedence Constraints

Claire Hanen (1, 2, 3) , Alix Munier-Kordon (4)

1 UPN - Université Paris Nanterre
2 UPL - Université Paris Lumières
3 RO - Recherche Opérationnelle
4 CIAN - Circuits Intégrés Numériques et Analogiques

We consider the computation of periodic cyclic schedules for linear precedence constraints graphs: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such that the difference of iterations is a linear function. The objective function is the minimization of the maximal period of a task. We recall first that this problem may be modelled using linear programming. A polynomial algorithm is then developed to solve it for a particular class of linear precedence graphs called unitary graphs. We also show that a periodic schedule may not exist for unitary graphs. In the general case, a decomposition of the linear precedence graph into unitary components is computed and we assume that a periodic schedule exists for each of these components. Lower bounds on the periods are exhibited and we show that an optimal periodic schedule may not achieve them. The notion of quasi-periodic schedule is then introduced and we prove that this new class of schedules always reaches these bounds.

Domaines: Informatique [cs]

Claire Hanen, Alix Munier-Kordon. Periodic Schedules for Linear Precedence Constraints. Discrete Applied Mathematics, 2009, 157 (2), pp.280-291. ⟨10.1016/j.dam.2008.03.018⟩. ⟨hal-01185124⟩