Sciweavers

Share
IFIP
2010
Springer

Dependency-Driven Distribution of Synchronous Programs

8 years 9 months ago
Dependency-Driven Distribution of Synchronous Programs
Abstract In this paper, we describe an automatic synthesis procedure that distributes synchronous programs on a set of desynchronized processing elements. Our distribution procedure consists of three steps: First, we translate the given synchronous program to synchronous guarded actions. Second, we analyze their data dependencies and represent them in a so-called action dependency graph (ADG). Third, the ADG is subsequently partitioned into of sub-graphs where cuts can be made horizontal (for a pipelined execution) or vertical (for a concurrent execution). Finally, we generate for each sub-graph a corresponding component and automatically synthesize a communication infrastructure between these components.
Daniel Baudisch, Jens Brandt, Klaus Schneider
Added 18 May 2011
Updated 18 May 2011
Type Journal
Year 2010
Where IFIP
Authors Daniel Baudisch, Jens Brandt, Klaus Schneider
Comments (0)
books