<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Resumen:
Finding Near-Optimal Configurations in Colossal Spaces with Statistical Guarantees

Cargando...
Miniatura

Editor

Sistedes

Publicado en

Actas de las XXVIII Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2024)

Licencia Creative Commons

Excepto donde se indique lo contrario, la licencia de este ítem se describe como CC BY-NC-ND 4.0

Resumen

A Software Product Line (SPL) is a family of similar programs. Each program is defined by a unique set of features, called a configuration, that satisfies all feature constraints. "What configuration achieves the best performance for a given workload?" is the SPL Optimization (SPLO) challenge. SPLO is daunting: just 80 unconstrained features yield 1024 unique configurations, which equals the estimated number of stars in the universe. We explain (a) how uniform random sampling and random search algorithms solve SPLO more efficiently and accurately than current machine-learned performance models and (b) how to compute statistical guarantees on the quality of a returned configuration; i.e., it is within x% of optimal with y% confidence.

Descripción

Acerca de Oh, Jeho

Citación

Oh, J., Batory, D., Heradio, R.: Finding Near-Optimal Configurations in Colossal Spaces with Statistical Guarantees. In: Rodríguez Luaces, M. A. (ed.) Actas de las XXVIII Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2024). Sistedes (2024). https://hdl.handle.net/11705/JISBD/2024/16