Black-box functions modeling is crucial in many optimization problems. However, the number of function evaluations is often limited by time or cost, as in Design Space Exploration (DSE). The literature mainly exploits genetic algorithms that, while effective in solving DSE, require several calls of expensive fitness functions (FTFNs), such as synthesis and place&route. Therefore, approximating these black-box calls would incredibly impact the final results. For these reasons, this manuscript proposes several improvements to existing DSE methodologies leveraging online learning models for an open-source approach generally applicable to FTFNs approximation. Through Adaptive Hoeffding Trees as surrogate models and Multi-Armed Bandits as controllers, our approach decides at each iteration whether to evaluate the real function or the surrogate model by annotating the FTFN. The proposed approach achieves a top speedup of 2.67x over the non-approximated DSE while delivering solutions comparable with the Pareto-optimal ones.

Online Learning RTL Synthesis for Automated Design Space Exploration

Francesco Peverelli;Davide Conficconi
2022-01-01

Abstract

Black-box functions modeling is crucial in many optimization problems. However, the number of function evaluations is often limited by time or cost, as in Design Space Exploration (DSE). The literature mainly exploits genetic algorithms that, while effective in solving DSE, require several calls of expensive fitness functions (FTFNs), such as synthesis and place&route. Therefore, approximating these black-box calls would incredibly impact the final results. For these reasons, this manuscript proposes several improvements to existing DSE methodologies leveraging online learning models for an open-source approach generally applicable to FTFNs approximation. Through Adaptive Hoeffding Trees as surrogate models and Multi-Armed Bandits as controllers, our approach decides at each iteration whether to evaluate the real function or the surrogate model by annotating the FTFN. The proposed approach achieves a top speedup of 2.67x over the non-approximated DSE while delivering solutions comparable with the Pareto-optimal ones.
2022
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
978-1-6654-9747-3
File in questo prodotto:
File Dimensione Formato  
movado_at_RAW22.pdf

Accesso riservato

Dimensione 517.43 kB
Formato Adobe PDF
517.43 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1213601
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 0
social impact