Distributed Memory Allocation Technique for Synchronous Dataflow Graphs

Abstract : This paper introduces a new distributed memory allocation technique for applications modeled with Synchronous Dataflow (SDF) graphs. This technique builds on a State-of-the-Art shared memory allocation technique based on a weighted graph, called Memory Exclusion Graph (MEG). A MEG captures the memory reuse opportunities between memory objects that must be allocated before the execution of an SDF graph. The algorithms detailed in this paper enable a single MEG to be split into separate MEGs, each of which is associated with a memory bank accessible only by one core of the architecture. The proposed technique is implemented within a rapid prototyping framework and is evaluated by deploying real computer vision applications on a Multiprocessor System-on-Chip (MPSoC). Results show a systematic performance improvement due to better memory usage, with application speedups ranging from 2% up to 380%.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01390486
Contributor : Karol Desnos <>
Submitted on : Wednesday, November 2, 2016 - 9:21:18 AM
Last modification on : Thursday, February 7, 2019 - 5:50:21 PM
Document(s) archivé(s) le : Friday, February 3, 2017 - 12:38:25 PM

File

20161026-SiPS16_Desnos.pdf
Files produced by the author(s)

Identifiers

Citation

Karol Desnos, Maxime Pelcat, Jean-François Nezan, Slaheddine Aridhi. Distributed Memory Allocation Technique for Synchronous Dataflow Graphs. 2016 IEEE International Workshop on Signal Processing Systems, Oct 2016, Dallas, TX, United States. 2016 IEEE International Workshop on Signal Processing Systems, Proceedings of,, 2016, 〈10.1109/SiPS.2016.16〉. 〈hal-01390486〉

Share

Metrics

Record views

260

Files downloads

109