On the Role of Search Budgets in Model-Based Software Refactoring Optimization

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Diaz-Pace, J. Andres, Di Pompeo, Daniele, Tucci, Michele
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912684088229888
author Diaz-Pace, J. Andres
Di Pompeo, Daniele
Tucci, Michele
author_facet Diaz-Pace, J. Andres
Di Pompeo, Daniele
Tucci, Michele
contents Software model optimization is a process that automatically generates design alternatives aimed at improving quantifiable non-functional properties of software systems, such as performance and reliability. Multi-objective evolutionary algorithms effectively help designers identify trade-offs among the desired non-functional properties. To reduce the use of computational resources, this work examines the impact of implementing a search budget to limit the search for design alternatives. In particular, we analyze how time budgets affect the quality of Pareto fronts by utilizing quality indicators and exploring the structural features of the generated design alternatives. This study identifies distinct behavioral differences among evolutionary algorithms when a search budget is implemented. It further reveals that design alternatives generated under a budget are structurally different from those produced without one. Additionally, we offer recommendations for designers on selecting algorithms in relation to time constraints, thereby facilitating the effective application of automated refactoring to improve non-functional properties.
format Preprint
id arxiv_https___arxiv_org_abs_2308_15179
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On the Role of Search Budgets in Model-Based Software Refactoring Optimization
Diaz-Pace, J. Andres
Di Pompeo, Daniele
Tucci, Michele
Software Engineering
Performance
Software model optimization is a process that automatically generates design alternatives aimed at improving quantifiable non-functional properties of software systems, such as performance and reliability. Multi-objective evolutionary algorithms effectively help designers identify trade-offs among the desired non-functional properties. To reduce the use of computational resources, this work examines the impact of implementing a search budget to limit the search for design alternatives. In particular, we analyze how time budgets affect the quality of Pareto fronts by utilizing quality indicators and exploring the structural features of the generated design alternatives. This study identifies distinct behavioral differences among evolutionary algorithms when a search budget is implemented. It further reveals that design alternatives generated under a budget are structurally different from those produced without one. Additionally, we offer recommendations for designers on selecting algorithms in relation to time constraints, thereby facilitating the effective application of automated refactoring to improve non-functional properties.
title On the Role of Search Budgets in Model-Based Software Refactoring Optimization
topic Software Engineering
Performance
url https://arxiv.org/abs/2308.15179