Scheduling Acyclic Branching Programs on Parallel Machines

Marius Bozga (1) , Abdelkarim Aziz Kerbaa (1) , Oded Maler (1)

1 VERIMAG - IMAG - VERIMAG

In this paper we adress the following problem: given an acyclic program scheme with if-then-else control structures, together with the duration of each rpocedure, and given an architecture consisting of n identical processors, compute offline a scheduling policy that will guarantee minimal execution time (in worst-case) for the entire program on this architecture. Since this is a problem of scheduling under uncertainty (the results of the branching decisions are not known in advance) it cannot be solved in a satisfactory manner using static or fixed priority schedulers but rather requires a state-dependent scheduling strategy. We use timed automata technology to derive such strategies using algorithms for finding shortest paths on game graphs.

Mots clés: scheduling; acyclic programs; uncertainty; optimal strategy; timed automata

Domaines: Systèmes embarqués

Marius Bozga, Abdelkarim Aziz Kerbaa, Oded Maler. Scheduling Acyclic Branching Programs on Parallel Machines. 25th IEEE Real-Time Systems Symposium RTSS 2004, Dec 2004, Lisbon, Portugal. pp.208-217. ⟨hal-00374877⟩