Compilation of Polychronous Data Flow Equations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2010

Compilation of Polychronous Data Flow Equations

Abstract

Chapter 1, on the "Compilation of Polychronous Data-Flow Equations", gives a thorough presentation of the program analysis and code generation techniques present in Polychrony, a compiler for the data-flow synchronous language Signal. Introduced in the late 1980s, Signal and its polychronous model of computation stand among the most developed concepts of synchronous programming. It allows to model concurrent embedded software architectures using high-level multi-clocked synchronous data-flow equations. The chapter defines the formal methodology consisting of all required program analysis and transformation techniques to automatically generate the sequential or concurrent code suiting the targer architecture (embedded or distributed) or compilation goals (modularity or performance).
Fichier principal
Vignette du fichier
signalChapter-Springer-2010.pdf (1.13 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00540493 , version 1 (29-11-2010)

Identifiers

Cite

Loïc Besnard, Thierry Gautier, Paul Le Guernic, Jean-Pierre Talpin. Compilation of Polychronous Data Flow Equations. Sandeep K. Shukla and Jean-Pierre Talpin. Synthesis of Embedded Software, Springer, pp.1-40, 2010, 978-1-4419-6399-4. ⟨10.1007/978-1-4419-6400-7_1⟩. ⟨inria-00540493⟩
176 View
421 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More