可配置软件系统骨干算法的比较分析
A Comparative Analysis of Backbone Algorithms for Configurable Software Systems
AI总结:
本文通过分析2371个来自真实世界可变性模型的公式,比较了5种先进算法在不同规模公式上的性能,发现算法2/3适合小规模公式,算法5在大规模公式中表现最佳,且过滤启发式对性能影响较小。
摘要:
布尔公式的核心是必须为真的字句集合,这一概念对可变性模型的关键操作至关重要,包括将用户配置决策传播以识别隐含功能选择、检测死功能和死代码块以及预处理公式以加速知识编译为可处理的表示形式,如二进制决策图。尽管其重要性,先前的实证研究仅在SAT竞赛公式(通常为测试SAT求解器极限而设计)上评估骨干算法,导致性能结论不一致。本研究首次对源自真实世界可变性模型的公式进行了全面评估,分析了5种先进算法的21种配置在2371个公式上的表现,这些公式来自变量数从100到186059、子句数从179到527240的可配置系统。结果表明,可变性模型公式在结构上不同,具有更高的子句密度但更简单的子句。我们的研究提供了清晰的算法选择指南:算法2/3(迭代加解法过滤)适合变量数1000以下的公式,而算法5(基于块的核心)通过自适应块大小选择为更大公式提供了最佳实用性能。此外,结果表明,过滤启发式对可变性模型性能影响微弱或为负。最后,本研究识别出一个研究空白:尽管算法5在最佳块大小下可将运行时间减少超过50%(相比算法2/3,即产品线工具实现的算法),但最佳块大小在不同公式中变化不可预测,目前无法估计,为未来研究指明了方向。
英文摘要:
The backbone of a Boolean formula is the set of literals that must be true in every assignment that satisfies the formula. This concept is fundamental to key operations on variability models, including propagating user configuration decisions to identify implied feature selections, detecting dead features and dead code blocks, and preprocessing formulas to accelerate knowledge compilation into tractable representations such as binary decision diagrams. Despite its importance, previous empirical studies have evaluated backbone algorithms solely on SAT competition formulas (typically engineered to test the limits of SAT solvers), leading to inconsistent conclusions about their performance. This study provides the first comprehensive evaluation of formulas derived from real-world variability models, analyzing 21 configurations of 5 state-of-the-art algorithms on 2,371 formulas from configurable systems ranging from 100 variables and 179 clauses to 186,059 variables and 527,240 clauses. The results indicate that variability model formulas are structurally distinct, with higher clause density but greater clause simplicity. Our research provides clear algorithm selection guidelines: Algorithm 2/3 (iterative with solution filtering) is recommended for formulas with 1,000 or fewer variables, while Algorithm 5 (chunked core-based) with adaptive chunk size selection provides the best practical performance for larger formulas. Also, the results show that filtering heuristics have negligible or negative effects on performance for variability models. Finally, the study identifies a research gap: while Algorithm 5 with optimal chunk size can achieve runtime reductions exceeding 50\% compared to Algorithm 2/3 (the one that product line tools implement), the optimal chunk size varies unpredictably across formulas and cannot currently be estimated, opening directions for future research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。