Pre- and post-scheduling memory allocation strategies on MPSoCs

Abstract : This paper introduces and assesses a new method to allocate memory for applications implemented on a shared memory Multiprocessor System-on-Chip (MPSoC). This method first consists of deriving, from a Synchronous Dataflow (SDF) algorithm description, a Memory Exclusion Graph (MEG) that models all the memory objects of the application and their allocation constraints. Based on the MEG, memory allocation can be performed at three different stages of the implementation process: prior to the scheduling process, after an untimed multicore schedule is decided, or after a timed multicore schedule is decided. Each of these three alternatives offers a distinct trade-off between the amount of allocated memory and the flexibility of the application multicore execution. Tested use cases are based on descriptions of real applications and a set of random SDF graphs generated with the SDF For Free (SDF3) tool. Experimental results compare several allocation heuristics at the three implementation stages. They show that allocating memory after an untimed schedule of the application has been decided offers a reduced memory footprint as well as a flexible multicore execution.
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00868945
Contributor : Karol Desnos <>
Submitted on : Wednesday, October 2, 2013 - 11:29:54 AM
Last modification on : Monday, February 25, 2019 - 3:14:07 PM
Document(s) archivé(s) le : Friday, January 3, 2014 - 7:25:09 AM

File

ESLSyn13.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00868945, version 1

Citation

Karol Desnos, Maxime Pelcat, Jean François Nezan, Slaheddine Aridhi. Pre- and post-scheduling memory allocation strategies on MPSoCs. Electronic System Level Synthesis Conference (ESLSyn13), May 2013, Austin, TX, United States. pp.60-65. ⟨hal-00868945⟩

Share

Metrics

Record views

470

Files downloads

694