Periodic schedules for Unitary Timed Weighted Event Graphs

Abir Benabid (1) , Claire Hanen (2, 3, 1) , Olivier Marchetti (4) , Alix Munier-Kordon (4)

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

Timed Weighted Event Graphs (in short TWEG) are widely used for modeling industrial problems or embedded systems. The aim of this paper is to develop polynomial algorithms to check the existence of periodic schedules and to compute their optimal throughput. A necessary and sufficient condition of existence of periodic schedules is first expressed. Then, we develop an algorithm to compute the optimal throughput of a periodic schedule. This theoretical work can be considered as a generalisation of Reiter's result ("Scheduling Parallel Computations", R. Reiter, JACM, 1968). The gap between the optimal throughput of a TWEG and the throughput of an optimal periodic schedule is also experimentally investigated for a circuit.

Mots clés: Timed Weighted Event Graphs; Periodic Schedule.; Periodic Schedule

Domaines: Recherche opérationnelle [math.OC]

Abir Benabid, Claire Hanen, Olivier Marchetti, Alix Munier-Kordon. Periodic schedules for Unitary Timed Weighted Event Graphs. 9ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2008), Feb 2008, Clermont-Ferrand, France. pp.17-31. ⟨hal-00371028⟩