Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, August 7, 2014 - 11:18:45 AM
Last modification on : Thursday, March 5, 2020 - 5:40:46 PM
Long-term archiving on: : Wednesday, November 26, 2014 - 1:05:47 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Daniel Baudisch, Jens Brandt, Klaus Schneider. Dependency-Driven Distribution of Synchronous Programs. 7th IFIP TC 10 Working Conference on Distributed, Parallel and Biologically Inspired Systems (DIPES) / 3rd IFIP TC 10 International Conference on Biologically-Inspired Collaborative Computing (BICC) / Held as Part of World Computer Congress (WCC) , Sep 2010, Brisbane, Australia. pp.169-180, ⟨10.1007/978-3-642-15234-4_17⟩. ⟨hal-01054477⟩



Record views


Files downloads