A GRASP metaheuristic for the robust mapping and routing of Dataflow Process Networks on Manycore architectures - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue 4OR: A Quarterly Journal of Operations Research Année : 2015

A GRASP metaheuristic for the robust mapping and routing of Dataflow Process Networks on Manycore architectures

Résumé

In this paper, we study the problem of joint placement and routing, both in the deterministic and stochastic cases, arising in the field of compilation of dataflow applications for manycore architectures. A GRASP algorithm is first proposed for solving the deterministic version and extended afterwards to treat the chance-constrained program with uncertainty affecting the weights of a dataflow process network. Extensive computational results, on representative synthetic benchmark and real data, illustrate the practical relevance of the approach, as well as the robustness of the obtained stochastic solutions.
Fichier non déposé

Dates et versions

hal-01218368 , version 1 (21-10-2015)

Identifiants

Citer

Oana Stan, Renaud Sirdey, Jacques Carlier, Dritan Nace. A GRASP metaheuristic for the robust mapping and routing of Dataflow Process Networks on Manycore architectures. 4OR: A Quarterly Journal of Operations Research, 2015, 13 (3), pp.309-334. ⟨10.1007/s10288-015-0280-0⟩. ⟨hal-01218368⟩
208 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More