A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures
From MaRDI portal
Publication:496107
DOI10.1007/s10288-015-0280-0zbMath1327.90157OpenAlexW4297994093MaRDI QIDQ496107
Dritan Nace, Jacques Carlier, Renaud Sirdey, Oana Stan
Publication date: 17 September 2015
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-015-0280-0
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Theory of compilers and interpreters (68N20)
Related Items (1)
Cites Work
- Unnamed Item
- A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
- Some simplified NP-complete graph problems
- Greedy randomized adaptive search procedures
- Combinatorial optimization. Theory and applications.
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- The Scenario Approach to Robust Control Design
This page was built for publication: A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures
