An Efficient Method for Uncertainty Propagation in Robust Software Performance Estimation
Aldeida Aleti, Catia Trubiani, Andr\'e van Hoorn, Pooyan Jamshidi

TL;DR
This paper introduces Polynomial Chaos Expansion (PCE) as an efficient alternative to Monte Carlo methods for uncertainty propagation in software performance estimation, significantly reducing computational costs while maintaining high accuracy.
Contribution
The paper extends PCE to robust performance estimation in software systems, demonstrating its efficiency and accuracy across diverse case studies.
Findings
PCE accurately estimates system robustness with over 97% accuracy.
PCE reduces performance evaluation time by up to 225 hours compared to Monte Carlo methods.
The approach is effective across different development phases and application domains.
Abstract
Software engineers often have to estimate the performance of a software system before having full knowledge of the system parameters, such as workload and operational profile. These uncertain parameters inevitably affect the accuracy of quality evaluations, and the ability to judge if the system can continue to fulfil performance requirements if parameter results are different from expected. Previous work has addressed this problem by modelling the potential values of uncertain parameters as probability distribution functions, and estimating the robustness of the system using Monte Carlo-based methods. These approaches require a large number of samples, which results in high computational cost and long waiting times. To address the computational inefficiency of existing approaches, we employ Polynomial Chaos Expansion (PCE) as a rigorous method for uncertainty propagation and further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
