Real-Time Systems Optimization with Black-box Constraints and Hybrid Variables
Sen Wang, Dong Li, Shao-Yu Huang, Xuanliang Deng, Ashrarul H. Sifat, Changhee Jung, Ryan Williams, Haibo Zeng
TL;DR
This paper tackles real-time system optimization with black-box schedulability constraints and a hybrid mix of continuous and discrete variables. It introduces NORTH+, a coordinate-descent extension of the NORTH framework, which alternates between continuous optimization (NMBO/VE) and discrete optimization (heuristics like RM) to achieve scalable improvements. The approach yields roughly 20% better solutions than the original NORTH on simulated task sets, highlighting practical gains in schedulability-aware design. The discussion outlines trade-offs between optimality, applicability, and efficiency, and sketches avenues for future work in multi-objective optimization and deeper discrete optimization integration.
Abstract
When optimizing real-time systems, designers often face a challenging problem where the schedulability constraints are non-convex, non-continuous, or lack an analytical form to understand their properties. Although the optimization framework NORTH proposed in previous work is general (it works with arbitrary schedulability analysis) and scalable, it can only handle problems with continuous variables, which limits its application. In this paper, we extend the applications of the framework NORTH to problems with a hybrid of continuous and discrete variables. This is achieved in a coordinate-descent method, where the continuous and discrete variables are optimized separately during iterations. The new framework, NORTH+, improves around 20% solution quality than NORTH in experiments.
