IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v231y2013i1p34-42.html
   My bibliography  Save this article

Iterative approaches for a dynamic memory allocation problem in embedded systems

Author

Listed:
  • Soto, María
  • Rossi, André
  • Sevaux, Marc

Abstract

Memory allocation has a significant impact on energy consumption in embedded systems. In this paper, we are interested in dynamic memory allocation for embedded systems with a special emphasis on time performance. We propose two mid-term iterative approaches which are compared with existing long-term and short-term approaches, and with an ILP formulation as well. These approaches rely on solving a static version of the allocation problem and they take advantage of previous works for addressing the static problem. A statistic analysis is carried out for showing that the mid-term approach is the best one in terms of solution quality.

Suggested Citation

  • Soto, María & Rossi, André & Sevaux, Marc, 2013. "Iterative approaches for a dynamic memory allocation problem in embedded systems," European Journal of Operational Research, Elsevier, vol. 231(1), pages 34-42.
    • Handle: RePEc:eee:ejores:v:231:y:2013:i:1:p:34-42
    DOI: 10.1016/j.ejor.2013.05.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713004153
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.05.016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wilbaut, Christophe & Salhi, Saïd & Hanafi, Saïd, 2009. "An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 199(2), pages 339-348, December.
    2. Munier Kordon, Alix & Note, Jean-Baptiste, 2005. "A buffer minimization problem for the design of embedded systems," European Journal of Operational Research, Elsevier, vol. 164(3), pages 669-679, August.
    3. Chang, Ching-Ter, 2002. "Optimization approach for data allocation in multidisk database," European Journal of Operational Research, Elsevier, vol. 143(1), pages 210-217, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    2. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
    3. Cao, Chengxuan & Gao, Ziyou & Li, Keping, 2012. "Capacity allocation problem with random demands for the rail container carrier," European Journal of Operational Research, Elsevier, vol. 217(1), pages 214-221.
    4. Tsai, Jung-Fa & Li, Han-Lin, 2005. "Technical note - On optimization approach for multidisk vertical allocation problems," European Journal of Operational Research, Elsevier, vol. 165(3), pages 835-842, September.
    5. Diaz, Juan Esteban & Handl, Julia & Xu, Dong-Ling, 2018. "Integrating meta-heuristics, simulation and exact techniques for production planning of a failure-prone manufacturing system," European Journal of Operational Research, Elsevier, vol. 266(3), pages 976-989.
    6. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
    7. Ivan Derpich & Carlos Herrera & Felipe Sepúlveda & Hugo Ubilla, 2021. "Complexity indices for the multidimensional knapsack problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 589-609, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:231:y:2013:i:1:p:34-42. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.