• Aucun résultat trouvé

Code generation for multi-phase tasks on a multi-core distributed memory platform

N/A
N/A
Protected

Academic year: 2021

Partager "Code generation for multi-phase tasks on a multi-core distributed memory platform"

Copied!
17
0
0

Texte intégral

Figure

Table 1: Phases and related data-dependencies
Figure 3: Overview of the Prelude compilation chain
Table 2: Size of memories for the experiments Memory (SPM architecture) Size
Figure 6: Observed speedup (higher is better)

Références

Documents relatifs

To generate optimized embedded code, the code generator is based on the principles presented in [5].The models and tools have been tested on NXT bricks, Arduino boards and

To achieve our first investigations we adopted an experi- mental methodology: (1) measuring each FMU computation time (running our real multi-simulation with only one FMU per node

This article presents a compilation process to automatically generate a parallel task code executable onto distributed mem- ory machines from a sequential code. This compilation

Code generation from an interface based hierarchy tar- gets embedded application by generating static C code from a scheduling/mapping of the graph for a given architecture.. One C

Using this design process, the most important and complicated parts of multi-processor development, such as the distribution of code for different processors, or synchro-

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

During this phase, we aim to discover automatically the performances of the target execution platform by collecting available information, such as comput- ing powers of

The father model may contain a steady wave (this may happen for instance when coupling a fluid flow model and a porous model) ; in that case the interface values W F (0 − ) and W F (0