Introduction to algorithms
Combinatorics in operations research
Handbook of combinatorics (vol. 2)
Power exploration for data dominated video applications
ISLPED '96 Proceedings of the 1996 international symposium on Low power electronics and design
Computers and Operations Research
IEEE Transactions on Computers
Tabu Search
A formal method for hardware IP design and integration under I/O and timing constraints
ACM Transactions on Embedded Computing Systems (TECS)
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Efficient system-level prototyping of power-aware dynamic memory managers for embedded systems
Integration, the VLSI Journal - Special issue: Low-power design techniques
A study of dynamic memory management in C++ programs
Computer Languages, Systems and Structures
On local search for the generalized graph coloring problem
Operations Research Letters
| Hi-index | 0.00 |
Memory allocation in embedded systems is one of the main challenges that electronic designers have to face. This part, rather difficult to handle is often left to the compiler with which automatic rules are applied. Nevertheless, an optimal allocation of data to memory banks may lead to great savings in terms of running time and energy consumption. This paper introduces an exact approach and a vns-based metaheuristic for addressing a memory allocation problem. Numerical experiments have been conducted on real instances from the electronic community and on dimacs instances expanded for our specific problem.