Reducing Memory Requirements of Stream Programs by Graph Transformations
| hal.structure.identifier | Laboratoire d'Intégration des Systèmes et des Technologies [LIST (CEA)] | |
| dc.contributor.author | DE OLIVEIRA CASTRO, Pablo | |
| hal.structure.identifier | Laboratoire d'Intégration des Systèmes et des Technologies [LIST (CEA)] | |
| dc.contributor.author | LOUISE, Stéphane | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Efficient runtime systems for parallel architectures [RUNTIME] | |
| dc.contributor.author | BARTHOU, Denis | |
| dc.date.accessioned | 2024-04-15T09:48:02Z | |
| dc.date.available | 2024-04-15T09:48:02Z | |
| dc.date.issued | 2010-06-28 | |
| dc.date.conference | 2011-06-28 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198145 | |
| dc.description.abstractEn | Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedded resource-constrained system, adapting stream programs to fit memory requirements is particularly important. In this paper we present a new approach to re- duce the memory footprint required to run stream programs on MPSoC. Through an exploration of equivalent program variants, the method selects parallel code minimizing mem- ory consumption. For large program instances, a heuristic accelerating the exploration phase is proposed and evalu- ated. We demonstrate the interest of our method on a panel of ten significant benchmarks. Using a multi-core modulo scheduling technique, our approach lowers considerably the minimal amount of memory required to run seven of these benchmarks while preserving throughput. | |
| dc.language.iso | en | |
| dc.source.title | International IEEE Conference on High Performance Computing and Simulation | |
| dc.subject.en | Graph Transformations | |
| dc.subject.en | Stream Languages | |
| dc.subject.en | Data Flow | |
| dc.subject.en | Mem- ory | |
| dc.subject.en | Graph Transformations. | |
| dc.title.en | Reducing Memory Requirements of Stream Programs by Graph Transformations | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/HPCS.2010.5547134 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | p171-180 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | International IEEE Conference on High Performance Computing and Simulation | |
| bordeaux.country | FR | |
| bordeaux.title.proceeding | International IEEE Conference on High Performance Computing and Simulation | |
| bordeaux.conference.city | Caen | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00551584 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00551584v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=International%20IEEE%20Conference%20on%20High%20Performance%20Computing%20and%20Simulation&rft.date=2010-06-28&rft.spage=p171-180&rft.epage=p171-180&rft.au=DE%20OLIVEIRA%20CASTRO,%20Pablo&LOUISE,%20St%C3%A9phane&BARTHOU,%20Denis&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||