Noname manuscript No will be inserted by the editor
29
pages
English
Documents
Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus
Découvre YouScribe en t'inscrivant gratuitement
Découvre YouScribe en t'inscrivant gratuitement
29
pages
English
Documents
Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus
Noname manuscript No. (will be inserted by the editor) Modular Static Scheduling of Synchronous Data-flow Networks An efficient symbolic representation Marc Pouzet · Pascal Raymond Received: January 2010 / Accepted: date Abstract This paper addresses the question of producing modular sequential impera- tive code from synchronous data-flow networks. Precisely, given a system with several input and output flows, how to decompose it into a minimal number of classes executed atomically and statically scheduled without restricting possible feedback loops between input and output? Though this question has been identified by Raymond in the early years of Lustre, it has almost been left aside until the recent work of Lublinerman, Szegedy and Tripakis. The problem is proven to be intractable, in the sense that it belongs to the family of optimization problems where the corresponding decision problem — there exists a solution with size c — is NP-complete. Then, the authors derive an iterative algorithm looking for solutions for c = 1, 2, ... where each step is encoded as a satisfiability (SAT) problem. Despite the apparent intractability of the problem, our experience is that real pro- grams do not exhibit such a complexity. Based on earlier work by Raymond, the current paper presents a new encoding of the problem in terms of input/output relations. This encoding simplifies the problem, in the sense that it rejects some solutions, while keep- ing all the optimal ones.
Voir
- output
- problem — there
- node
- tools such
- sequential
- flow networks
- main compilation approaches
- such
- code
