HAL (France)open access
Graph Transformations for Memory Peak Minimization by Scheduling
Dataflow, Memory peak, Task graph, SDF, 0, Sequential scheduling
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 427373
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.