Pre- and post-scheduling memory allocation strategies on MPSoCs
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 th...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 6 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Desnos, Karol Pelcat, Maxime Nezan, Jean-Francois Aridhi, Slaheddine |
description | 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. |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6573219</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6573219</ieee_id><sourcerecordid>6573219</sourcerecordid><originalsourceid>FETCH-LOGICAL-i105t-820ef0d1919fcc135be48737e75e6db13eaba35ac840197096301ea33b06f60c3</originalsourceid><addsrcrecordid>eNotzMtKw0AUgOEREdSaJ3AzLxA4Z85cMiuR4A1aLNiuy2RyUkdyKZm46Nsr6Orn2_wXovCuUt6Q95Xz5lLcoraOrEatrkWR8xcAICpNhm7Ew3bmUoaxlacpL2WOn9x-92k8yoGHaT7L0PdTDEuaRpmXOSx8TJzlrzbbj6nOd-KqC33m4r8rsX9-2tWv5fr95a1-XJcJwSxlpYA7aNGj72JEMg3rypFjZ9i2DRKHJpAJsdKA3oG3BMiBqAHbWYi0Evd_38TMh9OchjCfD9Y4UujpB9YdRCI</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Pre- and post-scheduling memory allocation strategies on MPSoCs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Desnos, Karol ; Pelcat, Maxime ; Nezan, Jean-Francois ; Aridhi, Slaheddine</creator><creatorcontrib>Desnos, Karol ; Pelcat, Maxime ; Nezan, Jean-Francois ; Aridhi, Slaheddine</creatorcontrib><description>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.</description><identifier>ISBN: 1467364142</identifier><identifier>ISBN: 9781467364140</identifier><identifier>EISBN: 9782953998795</identifier><identifier>EISBN: 2953998799</identifier><identifier>EISBN: 9782953998788</identifier><identifier>EISBN: 2953998780</identifier><language>eng</language><publisher>IEEE</publisher><subject>Memory management ; Multicore processing ; Parallel processing ; Resource management ; Runtime ; Schedules ; Timing</subject><ispartof>Proceedings of the 2013 Electronic System Level Synthesis Conference (ESLsyn), 2013, p.1-6</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6573219$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6573219$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Desnos, Karol</creatorcontrib><creatorcontrib>Pelcat, Maxime</creatorcontrib><creatorcontrib>Nezan, Jean-Francois</creatorcontrib><creatorcontrib>Aridhi, Slaheddine</creatorcontrib><title>Pre- and post-scheduling memory allocation strategies on MPSoCs</title><title>Proceedings of the 2013 Electronic System Level Synthesis Conference (ESLsyn)</title><addtitle>ESLsyn</addtitle><description>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.</description><subject>Memory management</subject><subject>Multicore processing</subject><subject>Parallel processing</subject><subject>Resource management</subject><subject>Runtime</subject><subject>Schedules</subject><subject>Timing</subject><isbn>1467364142</isbn><isbn>9781467364140</isbn><isbn>9782953998795</isbn><isbn>2953998799</isbn><isbn>9782953998788</isbn><isbn>2953998780</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzMtKw0AUgOEREdSaJ3AzLxA4Z85cMiuR4A1aLNiuy2RyUkdyKZm46Nsr6Orn2_wXovCuUt6Q95Xz5lLcoraOrEatrkWR8xcAICpNhm7Ew3bmUoaxlacpL2WOn9x-92k8yoGHaT7L0PdTDEuaRpmXOSx8TJzlrzbbj6nOd-KqC33m4r8rsX9-2tWv5fr95a1-XJcJwSxlpYA7aNGj72JEMg3rypFjZ9i2DRKHJpAJsdKA3oG3BMiBqAHbWYi0Evd_38TMh9OchjCfD9Y4UujpB9YdRCI</recordid><startdate>201305</startdate><enddate>201305</enddate><creator>Desnos, Karol</creator><creator>Pelcat, Maxime</creator><creator>Nezan, Jean-Francois</creator><creator>Aridhi, Slaheddine</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201305</creationdate><title>Pre- and post-scheduling memory allocation strategies on MPSoCs</title><author>Desnos, Karol ; Pelcat, Maxime ; Nezan, Jean-Francois ; Aridhi, Slaheddine</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i105t-820ef0d1919fcc135be48737e75e6db13eaba35ac840197096301ea33b06f60c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Memory management</topic><topic>Multicore processing</topic><topic>Parallel processing</topic><topic>Resource management</topic><topic>Runtime</topic><topic>Schedules</topic><topic>Timing</topic><toplevel>online_resources</toplevel><creatorcontrib>Desnos, Karol</creatorcontrib><creatorcontrib>Pelcat, Maxime</creatorcontrib><creatorcontrib>Nezan, Jean-Francois</creatorcontrib><creatorcontrib>Aridhi, Slaheddine</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Desnos, Karol</au><au>Pelcat, Maxime</au><au>Nezan, Jean-Francois</au><au>Aridhi, Slaheddine</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Pre- and post-scheduling memory allocation strategies on MPSoCs</atitle><btitle>Proceedings of the 2013 Electronic System Level Synthesis Conference (ESLsyn)</btitle><stitle>ESLsyn</stitle><date>2013-05</date><risdate>2013</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><isbn>1467364142</isbn><isbn>9781467364140</isbn><eisbn>9782953998795</eisbn><eisbn>2953998799</eisbn><eisbn>9782953998788</eisbn><eisbn>2953998780</eisbn><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.</abstract><pub>IEEE</pub><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1467364142 |
ispartof | Proceedings of the 2013 Electronic System Level Synthesis Conference (ESLsyn), 2013, p.1-6 |
issn | |
language | eng |
recordid | cdi_ieee_primary_6573219 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Memory management Multicore processing Parallel processing Resource management Runtime Schedules Timing |
title | Pre- and post-scheduling memory allocation strategies on MPSoCs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T16%3A10%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Pre-%20and%20post-scheduling%20memory%20allocation%20strategies%20on%20MPSoCs&rft.btitle=Proceedings%20of%20the%202013%20Electronic%20System%20Level%20Synthesis%20Conference%20(ESLsyn)&rft.au=Desnos,%20Karol&rft.date=2013-05&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.isbn=1467364142&rft.isbn_list=9781467364140&rft_id=info:doi/&rft_dat=%3Cieee_6IE%3E6573219%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9782953998795&rft.eisbn_list=2953998799&rft.eisbn_list=9782953998788&rft.eisbn_list=2953998780&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6573219&rfr_iscdi=true |