Exact multi-objective design space exploration using ASPmT

An efficient Design Space Exploration (DSE) is imperative for the design of modern, highly complex embedded systems in order to steer the development towards optimal design points. The early evaluation of design decisions at system-level abstraction layer helps to find promising regions for subsequent development steps in lower abstraction levels by diminishing the complexity of the search problem. In recent works, symbolic techniques, especially Answer Set Programming (ASP) modulo Theories (ASPmT), have been shown to find feasible solutions of highly complex system-level synthesis problems with non-linear constraints very efficiently. In this paper, we present a novel approach to a holistic system-level DSE based on ASPmT. To this end, we include additional background theories that concurrently guarantee compliance with hard constraints and perform the simultaneous optimization of several design objectives. We implement and compare our approach with a state-of-the-art preference handling framework for ASP. Experimental results indicate that our proposed method produces better solutions with respect to both diversity and convergence to the true Pareto front.

[1]  Michael Glaß,et al.  Supporting composition in symbolic system synthesis , 2016, 2016 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS).

[2]  Andy D. Pimentel,et al.  Exploiting domain knowledge in system-level MPSoC design space exploration , 2013, J. Syst. Archit..

[3]  Andy D. Pimentel,et al.  Exploring Exploration: A Tutorial Introduction to Embedded Systems Design Space Exploration , 2017, IEEE Design & Test.

[4]  Christian Haubelt,et al.  Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.

[5]  Martin Gebser,et al.  Theory Solving Made Easy with Clingo 5 , 2016, ICLP.

[6]  Martin Gebser,et al.  Progress in clasp Series 3 , 2015, LPNMR.

[7]  Martin Lukasiewycz,et al.  Improving system level design space exploration by incorporating SAT-solvers into multi-objective evolutionary algorithms , 2006, IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI'06).

[8]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[9]  Martin Lukasiewycz,et al.  Efficient symbolic multi-objective design space exploration , 2008, 2008 Asia and South Pacific Design Automation Conference.

[10]  A. Farhang-Mehr,et al.  An Information-Theoretic Entropy Metric for Assessing Multi-Objective Optimization Solution Set Quality , 2003 .

[11]  Ingo Sander,et al.  A modular design space exploration framework for multiprocessor real-time systems , 2016, 2016 Forum on Specification and Design Languages (FDL).

[12]  Michael Glaß,et al.  Symbolic System Synthesis Using Answer Set Programming , 2013, LPNMR.

[13]  Pier Luca Lanzi,et al.  Ant Colony Heuristic for Mapping and Scheduling Tasks and Communications on Heterogeneous Embedded Systems , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Torsten Schaub,et al.  asprin: Customizing Answer Set Preferences without a Headache , 2015, AAAI.