TY - JOUR
T1 - An Efficient Parallel Single Surrogate Objective Optimization Method for Multi-objective Black-box Problems and its Application in Processor Design
AU - Lv, Xiaoliang
AU - Zhai, Qiaozhu
AU - Zhu, Yuhang
AU - Hu, Jianchen
AU - Zhou, Yuzhou
AU - Guan, Xiaohong
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - With the growing complexity of modern micro-architectures, processor design must accommodate a wide array of parameters, resulting in vast design spaces. Identifying the optimal trade-offs among various design metrics poses a significant challenge. Performance is inherently difficult to model analytically, while area can be represented by analytical models. Performance evaluation relies on expensive and time-consuming cycle-accurate simulators (CAS), which puts forward strict requirements on the convergence speed and data dependence of the optimization methods. In this paper, based on the characteristics of the design metrics, the processor design problem is modeled as a hybrid black-box and white-box multi-objective discrete optimization problem (BWMO-DOP). In engineering applications, parallel simulation is a common acceleration technology. Therefore, white-box objective, area, is formulated as parallel constraints, while black-box objective, performance, is approximated by order-preserving surrogate objective. And then, BWMO-DOP is simplified into parallel single-objective expensive black-box optimization problems, which are solved by an efficient SOP-MOOA. SOP-MOOA iteratively explores more design points, enhancing the accuracy of the surrogate model while simultaneously updating the Pareto set. Experimental results demonstrate that the proposed algorithm outperforms baseline algorithm in an engineering case and three general numerical cases. In the engineering experiment for performance-area optimization, the proposed algorithm outperforms the baseline algorithm by a factor of more than two when considering the combined effect of performance improvement percentage and area reduction percentage. In numerical tests conducted on three 40-dimensional black-box functions under the same evaluation overhead, the proposed algorithm consistently identified Pareto set of superior quality.
AB - With the growing complexity of modern micro-architectures, processor design must accommodate a wide array of parameters, resulting in vast design spaces. Identifying the optimal trade-offs among various design metrics poses a significant challenge. Performance is inherently difficult to model analytically, while area can be represented by analytical models. Performance evaluation relies on expensive and time-consuming cycle-accurate simulators (CAS), which puts forward strict requirements on the convergence speed and data dependence of the optimization methods. In this paper, based on the characteristics of the design metrics, the processor design problem is modeled as a hybrid black-box and white-box multi-objective discrete optimization problem (BWMO-DOP). In engineering applications, parallel simulation is a common acceleration technology. Therefore, white-box objective, area, is formulated as parallel constraints, while black-box objective, performance, is approximated by order-preserving surrogate objective. And then, BWMO-DOP is simplified into parallel single-objective expensive black-box optimization problems, which are solved by an efficient SOP-MOOA. SOP-MOOA iteratively explores more design points, enhancing the accuracy of the surrogate model while simultaneously updating the Pareto set. Experimental results demonstrate that the proposed algorithm outperforms baseline algorithm in an engineering case and three general numerical cases. In the engineering experiment for performance-area optimization, the proposed algorithm outperforms the baseline algorithm by a factor of more than two when considering the combined effect of performance improvement percentage and area reduction percentage. In numerical tests conducted on three 40-dimensional black-box functions under the same evaluation overhead, the proposed algorithm consistently identified Pareto set of superior quality.
KW - binary integer programming
KW - design space exploration
KW - expensive black-box optimization
KW - hybrid black-box and white-box multi-objective optimization
KW - processor design
UR - https://www.scopus.com/pages/publications/105019197835
U2 - 10.1109/TASE.2025.3615954
DO - 10.1109/TASE.2025.3615954
M3 - 文章
AN - SCOPUS:105019197835
SN - 1545-5955
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
ER -