Modélisation formelle de systèmes Insensibles à la Latence et ordonnancement.

Julien Boucaron 1
1 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This PhD thesis introduces new results linking the theory of Latency Insensitive, to a well-known sub-class of Petri Nets called Marked Event Graphs and its extension called Synchronous Data Flow. This work is tightly linked with a well-known problem, called Central Repetitive Problem (workshop scheduling...). We introduce the Synchronous Models, Marked Event Graphs, Synchronous Data Flow (SDF) and Latency Insensitive. After, we discuss existing links between the Synchronous Models, Marked Event Graphs, Synchronous Data Flow (SDF) and Latency Insensitive ; we show that the Latency Insensitive model is a special case of the Marked Event Graph model. After, we recall a well-known result : any Marked Event Graph with at least a strongly connected component (and evaluating with the firing rule As Soon As Possible (ASAP)) enjoys an ultimately repetitive behaviour : that is to say that it exists a static schedule. Starting from this result, we build a specific scheduling scheme called Equalization that is altering virtually the communication topology in order to slow-down too fast pathes adding some "registers", while preserving the global performance in throughput of the original system. Finally, we introduce some limited control in the Latency Insensitive Model, with nodes called select and merge where conditions are known and independant of data flows, more precisely datas are directed by ultimately periodic binary words (just like in the case of the static scheduling). We are creating then an abstraction over the SDF model in order to determinate if the instance of the model accepts a schedule where the size of each place in bounded. We can verify then the liveness of the system through simulation if the original system was having at least a strongly connected component. Finally, we conclude and discuss possibilities for future works.
Document type :
Complete list of metadatas

Cited literature [70 references]  Display  Hide  Download
Contributor : Julien Boucaron <>
Submitted on : Wednesday, April 9, 2008 - 5:03:43 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on: Thursday, May 20, 2010 - 11:11:21 PM


  • HAL Id : tel-00271620, version 1



Julien Boucaron. Modélisation formelle de systèmes Insensibles à la Latence et ordonnancement.. Informatique [cs]. Université Nice Sophia Antipolis, 2007. Français. ⟨tel-00271620⟩



Record views


Files downloads