hal-00672606, version 1
Periodic scheduling of marked graphs using balanced binary words
Jean-Vivien Millo
1Robert De Simone
a, 1
N° RR-7891 (2012)
Résumé : This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The contributions of this paper is the proposed algorithm itself along with the characterization of the best execution of any MG.
- a – INRIA
- 1 : AOSTE (INRIA Rocquencourt / INRIA Sophia Antipolis / Laboratoire I3S)
- INRIA – Université de Nice Sophia Antipolis (UNS) – CNRS : UMR7271
- Collaboration : CIM PACA
- Domaine : Informatique/Théorie et langage formel
- Mots-clés : marked graph – scheduling – balanced binary word
- Référence interne : RR-7891
- hal-00672606, version 1
- http://hal.inria.fr/hal-00672606
- oai:hal.inria.fr:hal-00672606
- Contributeur : Jean-Vivien Millo
- Soumis le : Mercredi 22 Février 2012, 14:07:19
- Dernière modification le : Mardi 17 Avril 2012, 16:29:02
Documents associés
Exporter