Evaluating Risk and Confidence in Performance Bounds of Configuration Sampling Strategies
Kallistos Weis, Martina Maggio, Norbert Siegmund, Sven Apel
Abstract
Modern software usually exposes a large number of configuration options to the user, giving rise to enormous configuration spaces in practice. Appropriate choices for these options dramatically influence the performance of the software (throughput, memory consumption, execution time, etc.). However, due to the sheer size of the configuration space, systematically identifying the worst-or best-performing configurations is computationally infeasible through exhaustive exploration. Instead, practitioners rely on budgeted sampling strategies, such as uniform random sampling or statistical recursive search, to explore the configuration space under fixed measurement budgets in an attempt to find the worst-or best-performing configuration. Even worse, a fundamental limitation of existing sampling strategies is the lack of quantifiable guarantees that the selected configuration truly reflects worst-case (or best-case) performance. In this paper, we define the basic concepts of posterior risk and posterior confidence and present a probabilistic framework to evaluate how well sampling strategies identify the worst-or best-performing configuration of a software system. We evaluate our framework by comparing five representative sampling strategies on seven real-world configurable software systems. We find that statistical recursive search yields consistently tighter best-case guarantees-higher posterior confidence and lower posterior risk-than the alternatives at the same budget. Our results demonstrate the applicability of our framework as a principled basis for reporting, comparing, and refining sampling strategies, and as a tool for practitioners to select strategies and budgets with quantified guarantees across systems and sample sizes. CCS Concepts: • Software and its engineering → Software reliability; Software performance; Software configuration management and version control systems; • Theory of computation → Stochastic approximation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on5
- Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and SamplingMate Soos, Stephan Gocht, Kuldeep S. MeelCAV 2020 · 102 citations
- Mastering Uncertainty in Performance Estimations of Configurable Software SystemsJohannes Dorn, Sven Apel, Norbert SiegmundASE 2020 · 49 citations
- Predicting Software Performance with Divide-and-LearnJingzhi Gong, Tao ChenFSE 2023 · 17 citations
- Testing self-adaptive software with probabilistic guarantees on performance metricsClaudio Mandrioli, Martina MaggioFSE 2020 · 12 citations
- Search-based Diverse Sampling from Real-world Software Product LinesYi Xiang, Han Huang, Yuren Zhou, Sizhe Li et al.ICSE 2022 · 8 citations
Related papers
- Identifying Software Performance Changes Across Variants and VersionsStefan Mühlbauer, Sven Apel, Norbert SiegmundASE 2020 · 25 citations
- CoMSA: A Modeling-Driven Sampling Approach for Configuration Performance TestingYuanjie Xia, Zishuo Ding, Weiyi ShangASE 2023 · 3 citations
- Scalable Sampling of Highly-Configurable Systems: Generating Random Instances of the Linux KernelDavid Fernández-Amorós, Ruben Heradio, Christoph Mayr-Dorn, Alexander EgyedASE 2022 · 1 citation
- Balancing Performance and Costs in Best Arm IdentificationMichael O. Harding, Kirthevasan KandasamyNeurIPS 2025 · 1 citation
- LLM4Perf: Large Language Models Are Effective Samplers for Multi-Objective Performance ModelingXin Wang, Zhenhao Li, Zishuo DingICSE 2026
