General Memory Allocation Problem
María Soto, André Rossi, Marc Sevaux, Johann Laurent, Narendra Jussien · 2012
This chapter discusses the general memory allocation problem, called MemExplorer, in embedded systems. This problem is focused on the allocation of the data structures from a given application to a given memory architecture. This chapter describes the design of the different metaheuristics used for addressing the general memory allocation problem. Before presenting the metaheuristics for MemExplorer, the chapter presents the algorithms used for generating initial solutions, as well as two neighborhoods. Then, a tabu search-based approach is described with the two neighborhoods for exploring the solution space. The chapter presents a variable neighborhood search (VNS)-based approach hybridized with a tabu search-inspired method. Numerical experiments are conducted on a set of instances, and statistical analysis is used to assess the results. The proposed metaheuristic appears to be suitable for the electronic design needs of today and tomorrow.