Machine Learning for Energy-Performance-aware Scheduling
Not on the map. Why?
Abstract (arXiv)
In the post-Dennard era, optimizing embedded systems requires navigating complex trade-offs between energy efficiency and latency. Traditional heuristic tuning is often inefficient in such high-dimensional, non-smooth landscapes. In this work, we propose a Bayesian Optimization framework using Gaussian Processes to automate the search for optimal scheduling configurations on heterogeneous multi-core architectures. We explicitly address the multi-objective nature of the problem by approximating the Pareto Frontier between energy and time. Furthermore, by incorporating Sensitivity Analysis (fANOVA) and comparing different covariance kernels (e.g., Mat'ern vs. RBF), we provide physical interpretability to the black-box model, revealing the dominant hardware parameters driving system performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 22 references that are in the map. First posted on arXiv 30 Jan 2026.
Builds on
7 of 22 references.
References · 7
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2020Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimizationcited by 179
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 149
- 2018Maximizing acquisition functions for Bayesian optimizationcited by 114
- 2017Device Placement Optimization with Reinforcement Learningcited by 86
- 2022Tensor Program Optimization with Probabilistic Programscited by 30
- 2023Deep reinforcement learning for machine scheduling: Methodology, the state-of-the-art, and future directionscited by 8
Built on by
Not cited yet.