skip to main content
research-article

A comparative evaluation of multi-objective exploration algorithms for high-level design

Published:28 March 2014Publication History
Skip Abstract Section

Abstract

This article presents a detailed overview and the experimental comparison of 15 multi-objective design-space exploration (DSE) algorithms for high-level design. These algorithms are collected from recent literature and include heuristic, evolutionary, and statistical methods. To provide a fair comparison, the algorithms are classified according to the approach used and examined against a large set of metrics. In particular, the effectiveness of each algorithm was evaluated for the optimization of a multiprocessor platform, considering initial setup effort, rate of convergence, scalability, and quality of the resulting optimization. Our experiments are performed with statistical rigor, using a set of very diverse benchmark applications (a video converter, a parallel compression algorithm, and a fast Fourier transformation algorithm) to take a large spectrum of realistic workloads into account. Our results provide insights on the effort required to apply each algorithm to a target design space, the number of simulations it requires, its accuracy, and its precision. These insights are used to draw guidelines for the choice of DSE algorithms according to the type and size of design space to be optimized.

References

  1. G. Beltrame, L. Fossati, and D. Sciuto. 2009. ReSP: A nonintrusive transaction-level reflective MPSoC simulation platform for design space exploration. IEEE Trans. Comput. Aid. Des. Integr. Circuits Syst. 28, 12, 1857--1869. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. Beltrame, L. Fossati, and D. Sciuto. 2010. Decision-theoretic design space exploration of multiprocessor platforms. IEEE Trans. Comput. Aid. Des. Integr. Circuits Syst. 29, 7, 1083--1095. DOI: http://dx.doi.org/10.1109/TCAD.2010.2049053 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Beltrame and G. Nicolescu. 2011. A multi-objective decision-theoretic exploration algorithm for platform-based design. In Proceedings of the Design, Automation and Test in Europe (DATE).Google ScholarGoogle Scholar
  4. Carlos A. Coello Coello. 2000. An updated survey of GA-based multiobjective optimization techniques. ACM Comput. Surv. 32, 2, 109--143. DOI: http://dx.doi.org/10.1145/358923.358929 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Carlos A. Coello Coello. 1999. A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowl. Inform. Syst. 1, 3, 269--308.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Piotr Czyzak and Adrezej Jaszkiewicz. 1998. Pareto simulated annealinga metaheuristic technique for multiple-objective combinatorial optimization. J. Multi-Criteria Decision Anal. 7, 1, 34--47. DOI: http://dx.doi.org/10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6Google ScholarGoogle ScholarCross RefCross Ref
  7. Kalyanmoy Deb and Tushar Goel. 2001. Controlled elitist non-dominated sorting genetic algorithms for better convergence. In Evolutionary Multi-Criterion Optimization, Eckart Zitzler, Lothar Thiele, Kalyanmoy Deb, Carlos Artemio Coello Coello, and David Corne (Eds.), Lecture Notes in Computer Science, Vol. 1993, Springer Berlin, 67--81. DOI: http://dx.doi.org/10.1007/3-540-44719-9\_5 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Cagkan Erbas. 2006. System-Level Modelling and Design Space Exploration for Multiprocessor Embedded System-on-Chip Architectures. Amsterdam University Press.Google ScholarGoogle Scholar
  9. Carlos M. Fonseca and Peter J. Fleming. 1995. An overview of evolutionary algorithms in multiobjective optimization. Evol. Comput. 3, 1, 1--16. DOI: http://dx.doi.org/10.1162/evco.1995.3.1.1 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. William Fornaciari, Donatella Sciuto, Cristina Silvano, and Vittorio Zaccaria. 2002. A sensitivity-based design space exploration methodology for embedded systems. Des. Autom. Embed. Syst. 7, 1, 7--33. DOI: http://dx.doi.org/{10.1023/A:1019791213967}Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Givargis, F. Vahid, and J. Henkel. 2001. System-level exploration for Pareto-optimal configurations in parameterized systems-on-a-chip. In Proceedings of the IEEE/ACM International Conference on Computer Aided Design (ICCAD'01). 25--30. DOI: http://dx.doi.org/{10.1109/ICCAD.2001.968593} Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. D. Hill and M. R. Marty. 2008. Amdahl's Law in the multicore era. Computer 41, 7, 33--38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Ishibuchi and T. Murata. 1996. Multi-objective genetic local search algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation. 119--124. DOI: http://dx.doi.org/10.1109/ICEC.1996.542345Google ScholarGoogle ScholarCross RefCross Ref
  14. H. Ishibuchi and T. Murata. 1998. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Tran. Syst. Man Cybernet. Part C: Appli. Rev. 28, 3, 392--403. DOI: http://dx.doi.org/10.1109/5326.704576 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Stanley Jaddoe and Andy D Pimentel. 2008. Signature-based calibration of analytical system-level performance models. In Proceedings of the 8th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS'08). Lecture Notes in Computer Science, Vol. 5114, Springer-Verlag, Berlin, 268--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Andrzej Jaszkiewicz. 2004. A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Ann. Oper. Res. 131, 1--4, 135--158. DOI: http://dx.doi.org/10.1023/B:ANOR.0000039516.50069.5bGoogle ScholarGoogle ScholarCross RefCross Ref
  17. Andrzej Jaszkiewicz and Grzegorz Dbrowski. 2005. MOMH: Multiple objective meta heuristics. http://home.gna.org/momh/.Google ScholarGoogle Scholar
  18. Leslie Pack Kaelbling, Michael L. Littman, and Andrew P. Moore. 1996. Reinforcement learning: A survey. J. Artif. Intell. Res. 4, 237--285. http://citeseer.ist.psu.edu/kaelbling96reinforcement.html. Google ScholarGoogle ScholarCross RefCross Ref
  19. J. Kennedy and R. Eberhart. 1995. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, Vol. 4. 1942--1948. DOI: http://dx.doi.org/10.1109/ICNN.1995.488968Google ScholarGoogle Scholar
  20. Martin Lukasiewycz, Michael Glay, Christian Haubelt, and Jurgen Teich. 2008. Efficient symbolic multi-objective design space exploration. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'08). IEEE Computer Society Press, 691--696. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Giovanni Mariani, Aleksandar Brankovic, Gianluca Palermo, Jovana Jovic, Vittorio Zaccaria, and Cristina Silvano. 2010. A correlation-based design space exploration methodology for multi-processor systems-on-chip. In Proceedings of the 47th ACM/IEEE Design Automation Conference (DAC). 120--125. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. T. Marler and J. S. Arora. 2004. Survey of multi-objective optimization methods for engineering. Struct. Multidisciplinary Optim. 26, 6, 369--395. DOI: http://dx.doi.org/10.1007/s00158-003-0368-6Google ScholarGoogle ScholarCross RefCross Ref
  23. G. Martin. 2006. Overview of the MPSoC design challenge. In Proceedings of the 43rd ACM/IEEE Design Automation Conference. 274--279. DOI: http://dx.doi.org/{10.1109/DAC.2006.229245} Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Kaisa Miettinen and Marko M. Mkel. 2002. On scalarizing functions in multiobjective optimization. OR Spectrum 24, 2, 193--213. DOI: http://dx.doi.org/10.1007/s00291-001-0092-9Google ScholarGoogle ScholarCross RefCross Ref
  25. S. Mohanty, V. K. Prasanna, S. Neema, and J. Davis. 2002. Rapid design space exploration of heterogeneous embedded systems using symbolic search and multi-granular simulation. SIGPLAN Not. 37, 7, 18--27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. T. Okabe, Y. Jin, and B. Sendhoff. 2003. A critical survey of performance indices for multi-objective optimisation. In Proceedings of the Congress on Evolutionary Computation (CEC'03). Vol. 2. 878--885. DOI: http://dx.doi.org/10.1109/CEC.2003.1299759Google ScholarGoogle Scholar
  27. G. Palermo, C. Silvano, and V. Zaccaria. 2008. Discrete particle swarm optimization for multi-objective design space exploration. In Proceedings of the 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools (DSD'08). 641--644. DOI: http://dx.doi.org/10.1109/DSD.2008.21 Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. G. Palermo, C. Silvano, and V. Zaccaria. 2009. ReSPIR: A response surface-based pareto iterative refinement for application-specific design space exploration. IEEE Trans. Comput. Aid. Des. Integr. Circuits Syst. 28, 12, 1816--1829. DOI: http://dx.doi.org/10.1109/TCAD.2009.2028681 Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Maurizio Palesi and Tony Givargis. 2002. Multi-objective design space exploration using genetic algorithms. In Proceedings of the 10th International Symposium on Hardware/Software Codesign (CODES'02). ACM, 67--72. DOI: http://dx.doi.org/10.1145/774789.774804 Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. P. G. Paulin and J. P. Knight. 1989. Algorithms for high-level synthesis. IEEE Des. Test Comput. 6, 6, 18--31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. A. D. Pimentel, C. Erbas, and S. Polstra. 2006. A systematic approach to exploring embedded system architectures at multiple abstraction levels. IEEE Trans. Computers 55, 2, 99--112. DOI: http://dx.doi.org/{10.1109/TC.2006.16} Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Stuart J. Russell and Peter Norvig. 1995. Artificial Intelligence: A Modern Approach 1st Ed. Prentice Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Paolo Serafini. 1994. Simulated annealing for multi objective optimization problems. In Multiple Criteria Decision Making, G. H. Tzeng, H. F. Wang, U. P. Wen, and P. L. Yu (Eds.), Springer, New York, 283--292. DOI: http://dx.doi.org/10.1007/978-1-4612-2666-6\_29Google ScholarGoogle Scholar
  34. D. Sheldon, F. Vahid, and S. Lonardi. 2007. Soft-core processor customization using the design of experiments paradigm. In Proceedings of the DATE Conference. 1--6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. S. N. Sivanandam and S. N. Deepa. 2007. Introduction to Genetic Algorithms 1st Ed. Springer, Inc. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. N. Srinivas and Kalyanmoy Deb. 1994. Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2, 3, 221--248. DOI: http://dx.doi.org/10.1162/evco.1994.2.3.221 Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Toktam Taghavi and Andy D. Pimentel. 2011. Design metrics and visualization techniques for analyzing the performance of MOEAs in DSE. In Proceedings of the International Conference on Embedded Computer Systems: Architectures Modeling, and Simulation (ICSAMOS). 67--76.Google ScholarGoogle Scholar
  38. E. L. Ulungu, J. Teghem, P. H. Fortemps, and D. Tuyttens. 1999. MOSA method: A tool for solving multiobjective combinatorial optimization problems. J. Multi-Criteria Decision Anal. 8, 4, 221--236. DOI: http://dx.doi.org/10.1002/(SICI)1099-1360(199907)8:4{221::AID-MCDA247}3.0.CO;2-OGoogle ScholarGoogle ScholarCross RefCross Ref
  39. E. L. Ulungu and J. Teghem. 1994. Multi-objective combinatorial optimization problems: A survey. J. Multi-Criteria Decision Anal. 3, 2, 83--104. DOI: http://dx.doi.org/10.1002/mcda.4020030204Google ScholarGoogle ScholarCross RefCross Ref
  40. Vittorio Zaccaria, Gianluca Palermo, F. Castro, Cristina Silvano, and Giovanni Mariani. 2010. Multicube explorer: An open source framework for design space exploration of chip multi-processors. In Proceedings of the Workshop on Parallel Programming and Run-time Management Techniques for Many-core Architectures.Google ScholarGoogle Scholar
  41. E. Zitzler, K. Deb, and L. Thiele. 1999a. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results (Revised Version). TIK Report 70, Computer Engineering and Networks Laboratory (TIK), ETH Zurich.Google ScholarGoogle Scholar
  42. E. Zitzler, K. Deb, and L. Thiele. 1999b. Comparison of multiobjective evolutionary algorithms on test functions of different difficulty. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99): Bird-of-a-feather Workshop on Multi-criterion Optimization.Google ScholarGoogle Scholar
  43. E. Zitzler and L. Thiele. 1999. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3, 4, 257--271. DOI: http://dx.doi.org/10.1109/4235.797969 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A comparative evaluation of multi-objective exploration algorithms for high-level design

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Design Automation of Electronic Systems
            ACM Transactions on Design Automation of Electronic Systems  Volume 19, Issue 2
            March 2014
            314 pages
            ISSN:1084-4309
            EISSN:1557-7309
            DOI:10.1145/2597648
            Issue’s Table of Contents

            Copyright © 2014 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 28 March 2014
            • Accepted: 1 December 2013
            • Revised: 1 October 2013
            • Received: 1 July 2013
            Published in todaes Volume 19, Issue 2

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader