Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies

Jesús Sánchez-Oro 1 Marc Sevaux 2 André Rossi 2 Rafael Marti 3 Abraham Duarte 1
2 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01119892
Contributor : Marc Sevaux <>
Submitted on : Tuesday, February 24, 2015 - 11:47:41 AM
Last modification on : Monday, February 25, 2019 - 3:14:11 PM

Identifiers

Citation

Jesús Sánchez-Oro, Marc Sevaux, André Rossi, Rafael Marti, Abraham Duarte. Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. Electronic Notes in Discrete Mathematics, Elsevier, 2015, 47, pp.85-92. ⟨10.1016/j.endm.2014.11.012⟩. ⟨hal-01119892⟩

Share

Metrics

Record views

392