ACM Home Page
Please provide us with feedback. Feedback
Analysis of multi-objective evolutionary algorithms to optimize dynamic data types in embedded systems
Full text PdfPdf (320 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Real-world application papers table of contents
Pages 1515-1522  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
J. Ignacio Hidalgo  Complutense University of Madrid, Madrid, Spain
José L. Risco-Martín  Complutense University of Madrid, Madrid, Spain
David Atienza  Complutense University of Madrid, Madrid, Spain
Juan Lanchares  Complutense University of Madrid, Madrid, Spain
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 44,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389388
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
F. Catthoor et al. Data access and storage management for embedded programmable processors. Kluwer Academic Publishers, 2002.
 
5
E. G. Daylight et al. Memory-access-aware data structure transformations for embedded software with dynamic data accesses. IEEE Transactions on VLSI Systems, 12:269--280, 2004.
 
6
 
7
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, 2002.
 
8
J. Edler. Dinero IV trace-driven uniprocessor cache simulator. Available at http://pages.cs.wisc.edu/~markhill/DineroIV, 2007.
 
9
K. Hardee et al. A 0.6v 205MHz 19.5ns tRC 16Mb embedded DRAM. In IEEE International Solid-State Circuits Conference (ISSCC), 2004.
 
10
L. Kharevych and R. Khan. 3D physics engine for elastic and deformable bodies. Available at http://www.cs.umd.edu/Honors/reports/kharevych.html, 2002. University of Maryland, College Park.
 
11
12
 
13
 
14
 
15
J. R. Schott. Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. PhD thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1995.
 
16
P. Shivakumar and N. P. Jouppi. Cacti 3.0: An integrated cache timing, power, and area model. Technical Report 2001/2, Compaq Computer Corporation, 2001.
 
17
Sourceforge. Vdrift racing simulator. Available at http://sourceforge.net/projects/vdrift.
 
18
S. Wuytack, F. Catthoor, and H. De Man. Transforming set data types to power optimal data structures. IEEE Transactions on Computer-Aided Design, 15(6):619--629, 1996.
 
19
E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In Proceedings of the Evolutionary Methods for Design, Optimization and Control with Application to Industrial Problems, pages 95--100, Barcelona, Spain, 2002.
 
20
E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computing, 3(4):257--271, 1998.


Collaborative Colleagues:
J. Ignacio Hidalgo: colleagues
José L. Risco-Martín: colleagues
David Atienza: colleagues
Juan Lanchares: colleagues