WCDT:决策树实现的系统性WCET优化
WCDT: Systematic WCET Optimization for Decision Tree Implementations
AI总结:
本文提出了一种针对决策树实现的系统性WCET优化方法,通过引入线性代理模型估计路径执行时间,并提供优化算法构建WCET最优实现,实验证明其能将分析确定的WCET降低高达17%。
摘要:
机器学习模型正越来越多地部署在具有严格时间约束的资源受限嵌入式系统上。在这种情况下,需要模型的最坏情况执行时间(WCET)来确保安全运行。具体而言,决策树是一类重要的机器学习模型,也是基于树的集成模型(如随机森林)的主要构建块,这些模型通常用于资源受限的嵌入式系统。在本文中,我们开发了一种对决策树实现进行WCET优化的系统方法。为此,我们引入了一个线性代理模型,该模型根据路径长度和所采用的分支数来估计穿过决策树的单个路径的执行时间。我们提供了一种优化算法,该算法针对该代理模型构造性地构建给定决策树的WCET最优实现。我们通过实验评估了代理模型和WCET优化算法。评估表明,与未优化的实现相比,该优化算法将分析确定的WCET提高了高达17%。
英文摘要:
Machine-learning models are increasingly deployed on resource-constrained embedded systems with strict timing constraints. In such scenarios, the worst-case execution time (WCET) of the models is required to ensure safe operation. Specifically, decision trees are a prominent class of machine-learning models and the main building blocks of tree-based ensemble models (e.g., random forests), which are commonly employed in resource-constrained embedded systems. In this paper, we develop a systematic approach for WCET optimization of decision tree implementations. To this end, we introduce a linear surrogate model that estimates the execution time of individual paths through a decision tree based on the path's length and the number of taken branches. We provide an optimization algorithm that constructively builds a WCET-optimal implementation of a given decision tree with respect to this surrogate model. We experimentally evaluate both the surrogate model and the WCET-optimization algorithm. The evaluation shows that the optimization algorithm improves analytically determined WCET by up to $17\%$ compared to an unoptimized implementation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。