ACM Home Page
Please provide us with feedback. Feedback
Mixed heuristic and mathematical programming using reference points for dynamic data types optimization in multimedia embedded systems
Full text PdfPdf (667 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 13: real world application table of contents
Pages 1601-1608  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
José L. Risco-Martín  Universidad Complutense de Madrid, Madrid, Spain
J. Ignacio Hidalgo  Universidad Complutense de Madrid, Madrid, Spain
David Atienza  Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Juan Lanchares  Universidad Complutense de Madrid, Madrid, Spain
Oscar Garnica  Universidad Complutense de Madrid, Madrid, Spain
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

New multimedia embedded applications are becoming increasingly dynamic. Thus, they cannot only rely on static data allocation, and must employ Dynamically-allocated Data Types (DDTs) to store their data and efficiently use the limited physical resources of embedded devices. However, the optimization of the DDTs for each target embedded system is a very time-consuming process due to the large design space of possible DDTs implementations and selection for the memory hierarchy of each specific embedded device. Thus, new suitable exploration methods for embedded design metrics (memory accesses, usage and power consumption) need to be developed. In this paper we analyze the benefits of two different exploration techniques for DDTs optimization: Multi-Objective Particle Swarm Optimization (MOPSO) and a Mixed Integer Linear Program (MILP). Furthermore, we propose a novel MOPSO exploration method, OMOPSO*, which uses MILP solutions, as reference points, to guide a MOPSO exploration and reach solutions closer to the real Pareto front of solutions. Our experiments with two real-life embedded applications show that our algorithm achieves 40% better coverage and set of solutions than state-of-the-art optimization methods for DDTs (MOGAs and other MOPSOs).


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
ILOG CPLEX. http://www.ilog.com, 2008.
 
2
VDrift racing simulator. http://vdrift.net, 2008.
3
 
4
F. Catthoor, K. Danckaert, C. Kulkarni, E. Brockmeyer, P.G. Kjeldsberg, T.V. Achteren, and T. Omnes. Data access and storage management for embedded programmable processors. Kluwer Academic Publishers, 2002.
 
5
J.M. Cruz, J.L. Risco-Martín, A. Herrán-González, and P. Fernández-Blanco. Hybrid heuristic and mathematical programming in oil pipelines networks. In CEC'04: Proceedings of the 2004 Congress On Evolutionary Computation, volume 2, pages 1479--1486, June 2004.
 
6
E.G. Daylight, D. Atienza, A. Vandecappelle, F. Catthoor, and J.M. Mendias. Memory-access-aware data structure transformations for embedded software with dynamic data accesses. IEEE Transactions on VLSI Systems, 12:269--280, 2004.
 
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
K. Hardee, F. Jones, D. Butler, M. Parris, M. Mound, H. Calendar, G. Jones, L. Aldrich, C. Gruenschlaeger, M. Miyabayashil, K. Taniguchi, and I. Arakawa. A 0.6V 205MHz 19.5ns tRC 16Mb embedded DRAM. In IEEE International Solid-State Circuits Conference (ISSCC), 2004.
9
 
10
L. Kharevych and R. Khan. 3D physics engine for elastic and deformable bodies. University of Maryland, College Park, 2002.
 
11
X. Li. A non-dominated sorting particle swarm optimizer for multiobjective optimization. In Genetic and Evolutionary Computation -- GECCO-2003, volume 2723 of LNCS, pages 37--48, Chicago, 2003. Springer-Verlag.
 
12
F.A. Lootsma. Multi-Criteria Decision Analysis via Ratio and Difference Judgement, chapter Multi-Objective Linear Programming, pages 1384--6485. Springer, 1999.
 
13
14
 
15
M. Reyes-Sierra and C.A.C. Coello. Improving PSO-based multi-objective optimization using crowding, mutation and epsilon-dominance. In EMO, pages 505--519, 2005.
 
16
M. Reyes-Sierra and C.A.C. Coello. Multi-objective particle swarm optimizers: A survey of the state-of-the-art. International Journal of Computational Intelligence Research, 2(3):287--308, 2006.
 
17
J.L. Risco-Martín. Java Evolutionary COmputation library (JECO). Available at: https://sourceforge.net/projects/jeco, 2008.
 
18
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.
19
 
20
L.A. Wolsey. Integer Programming. John Wiley and Sons, 1998.
 
21
E. Zitzler. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), 1999.
 
22
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.

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