Dependency-Driven Distribution of Synchronous Programs - Distributed, Parallel and Biologically Inspired Systems Access content directly
Conference Papers Year : 2010

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.
Fichier principal
Vignette du fichier
final_015.pdf (327.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01054477 , version 1 (07-08-2014)

Licence

Attribution

Identifiers

Cite

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⟩
183 View
244 Download

Altmetric

Share

Gmail Facebook X LinkedIn More