@conference{Oliveira10Reducing,
  pdf={streammemory-hpcs10.pdf},
  title={{Reducing memory requirements of stream programs by graph transformations}},
  author={de <NAME>, <NAME> <NAME> <NAME>},
  booktitle={High Performance Computing and Simulation (HPCS), 2010 International Conference on},
  pages={171--180},
  year={2010},
  publisher = {IEEE Computer Society},
  doi = {http://doi.ieeecomputersociety.org/10.1109/HPCS.2010.5547134},
  abstract = {{
  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 reduce the memory footprint required to run stream programs on MPSoC. Through an exploration of equivalent program variants, the method selects parallel code minimizing memory consumption. For large program instances, a heuristic accelerating the exploration phase is proposed and evaluated. 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.
  }},
}
@unpublished{DEOLIVEIRACASTRO:2009:HAL-00447376:1,
  HAL_ID = {hal-00447376},
  pdf = {http://hal.archives-ouvertes.fr/hal-00447376/PDF/stream_transformations_hal.pdf},
  title = { {D}esign-{S}pace {E}xploration of {S}tream {P}rograms through {S}emantic-{P}reserving {T}ransformations},
  author={<NAME>, <NAME> <NAME>},
  abstract = {{S}tream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core {M}ulti-{P}rocessor {S}ystems on {C}hip ({MPS}o{C}). {I}n an embedded resource-constrained system, adapting stream programs to fit memory requirements is particularly important. {I}n this paper we present a design-space exploration technique to reduce the minimal memory required when running stream programs on {MPS}o{C}; this allows to target memory constrained systems and in some cases obtain better performance. {U}sing a set of semantically preserving transformations, we explore a large number of equivalent program variants; we select the variant that minimizes a buffer evaluation metric. {T}o cope efficiently with large program instances we propose and evaluate an heuristic for this method. {W}e demonstrate the interest of our method on a panel of ten significant benchmarks. {A}s an illustration, we measure the minimal memory required using a multi-core modulo scheduling. {O}ur approach lowers considerably the minimal memory required for seven of the ten benchmarks.},
}

@PHDTHESIS{Oliveira:phd,
  pdf = {these-oliveira.pdf},
  title = {{Expression et optimisation des r\'eorganisations de donn\'ees dans du
  parall\'elisme de flots}},
  author = {<NAME>, Pablo},
  year = {2010},
  school = {Universit\'e de Versailles Saint Quentin en Yvelines},
}
