Synchronous distribution of SIGNAL programs
Résumé
SIGNAL, a synchronous and data-flow oriented language, allows the user to design safe real-time applications. Its compiler uses a single formalism called “synchronized data-flow graphs” (SDFGs) all along the conception chain from specification to proof and verification. We show how this formalism can be kept on until distributed code generation. The described implementation, called synchronous distribution, respects the semantics of SIGNAL. We finally show the limits of SDFGs and conclude with a discussion on the necessity of another model describing dynamic behaviours of distributed executions.
Mots clés
data flow computing
data flow graphs
parallel languages
parallel programming
parallelising compilers
real-time systems
synchronisation
SIGNAL programs
compiler
conception chain
distributed code generation
distributed executions
dynamic behaviours
proof
safe real-time applications design
semantics
specification
synchronized data-flow graphs
synchronous data-flow oriented language
synchronous distribution
verification
Domaines
Systèmes embarqués
Origine : Fichiers produits par l'(les) auteur(s)
Loading...