A multiple neighborhood search for dynamic memory allocation in embedded systems

Maria Soto 1 André Rossi 1, 2 Marc Sevaux 1
1 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : Memory allocation has a significant impact on power consumption in embedded systems. We address the dynamic memory allocation problem, in which memory requirements may change at each time interval. This problem has previously been addressed using integer linear programming and iterative approaches which build a solution interval by interval taking into account the requirements of partial time intervals. A GRASP that builds a solution for all time intervals has been proposed as a global approach. Due to the complexity of this problem, the GRASP algorithm solution quality decreases for larger instances. In order to overcome this drawback, we propose a multiple neighborhood search hybridized with a Tabu Search and enhanced by complex ejection chains. The proposed approach outperforms all previously developed methods devised for the dynamic memory allocation problem.
Type de document :
Article dans une revue
Journal of Heuristics, Springer Verlag, 2015, 21 (6), pp.719-749. 〈10.1007/s10732-015-9297-y〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01228903
Contributeur : Marc Sevaux <>
Soumis le : samedi 14 novembre 2015 - 16:36:24
Dernière modification le : mercredi 19 décembre 2018 - 14:06:02

Identifiants

Citation

Maria Soto, André Rossi, Marc Sevaux. A multiple neighborhood search for dynamic memory allocation in embedded systems. Journal of Heuristics, Springer Verlag, 2015, 21 (6), pp.719-749. 〈10.1007/s10732-015-9297-y〉. 〈hal-01228903〉

Partager

Métriques

Consultations de la notice

241