Desynchronizing Synchronous Programs by Modes

Brandt, Jens; Gemünde, Mike; Schneider, Klaus

doi:10.1109/acsd.2009.24

Cited by 4 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While a data flow analysis may be able to detect the independence of threads and is then able to desynchronize such programs [7,9], adding an explicit notion of independence allows compilers to create desynchronized code without expensive analyses since unnecessary synchronization is avoided by construction. While this is no problem when generating code containing a single thread of execution, it becomes problematic for multithreaded code generation.…”

Section: Introductionmentioning

confidence: 99%

Compilation of imperative synchronous programs with refined clocks

Gemünde

Brandt

Schneider

2010

Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)

Self Cite

View full text Add to dashboard Cite

To overcome over-synchronization in synchronous programs, we recently introduced clock refinement to our synchronous programming language Quartz. This extension basically allows programmers to refine reaction steps into smaller internal computation steps while maintaining the external behavior. In this paper, we consider the compilation of the extended Quartz programs to synchronous guarded actions. To this end, we first define an intermediate language supporting multiple clocks based on synchronous guarded actions which is the target of the front-end of the compiler and the source of back-end tools that perform efficient analysis and synthesis procedures. We moreover present a compilation scheme to translate the extended Quartz programs to the new intermediate language. We discuss important design considerations and illustrate our approach with the help of some small examples.

show abstract

Section: Introductionmentioning

confidence: 99%

Compilation of imperative synchronous programs with refined clocks

Gemünde

Brandt

Schneider

2010

Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Owing to the analogy to synchronous hardware circuit, one can assume that the given synchronous program holds a master clock driving the whole program computation. We refer to such program as a mono-clocked program [19]. Furthermore, it follows the model of computation (MoC) strict synchrony: during each instant, each input channel always reads data and each output channel always produces data.…”

Section: Introductionmentioning

confidence: 99%

Optimized distribution of synchronous programs via a polychronous model

Sun

Besnard

Gautier

2014

2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)

View full text Add to dashboard Cite

This paper presents a distribution methodology for synchronous programs, applied in particular on programs written in the Quartz language. The given program is first transformed into an intermediate model of guarded actions. After userspecified partitioning, the generated sub-models are transformed into Signal processes. Using the multi-clock calculation model of the Signal language, an optimized data-flow network can be automatically constructed. The optimization includes reducing the communication quantity and the computation load, with no change to the interface behaviors.

show abstract