Periodic schedules for Unitary Timed Weighted Event Graphs

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download
Contributor : Olivier Marchetti <>
Submitted on : Thursday, March 26, 2009 - 11:41:44 AM
Last modification on : Thursday, March 21, 2019 - 2:30:23 PM
Long-term archiving on : Thursday, June 10, 2010 - 6:43:57 PM


Files produced by the author(s)


  • HAL Id : hal-00371028, version 1


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⟩



Record views


Files downloads