Analysis of Multi-Objective Evolutionary Algorithms to Optimize Dynamic Data Types in Embedded Systems

New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target embedded system is a time-consuming process due to the large design space of possible DDTs implementations. Thus, suitable exploration methods for embedded design metrics (memory accesses, memory usage and power consumption) need to be developed. In this work we present a detailed analysis of the characteristics of different types of Multi-Objective Evolutionary Algorithms (MOEAs) to tackle the optimization of DDTs in multimedia applications and compare them with other state-of-the-art heuristics. Our results with state-of-the-art MOEAs in two object-oriented multimedia embedded applications show that more sophisticated MOEAs (SPEA2 and NSGA-II) offer better solutions than simple schemes (VEGA). Moreover, the suitable sophisticated scheme varies according to the available exploration time, namely, NSGA-II outperforms SPEA2 in the first set of solutions (300-500 generations), while SPEA2 offers better solutions afterwards.

Published in:
Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO '08), 1515-1522
Presented at:
10th Annual Conference on Genetic and Evolutionary Computation (GECCO '08), Atlanta, July 12-16, 2008
Atlanta, ACM

 Record created 2008-11-13, last modified 2018-03-17

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)