.png){kind=icon}
Return
Mutation-based analysis of queueing network performance models
.png){kind=icon}
OA
AI
DOI：10.1016/j.jss.2022.111385.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Performance models have been used in the past to understand the performance characteristics of software systems. However, the identification of performance criticalities is still an open challenge, since there might be several system components contributing to the overall system performance. This work combines two different areas of research to improve the process of interpreting modelbased performance analysis results: (i) software performance engineering that provides the ground for the evaluation of the system's performance; (ii) mutation-based techniques that nicely supports the experimentation of changes in performance models and contribute to a more systematic assessment of performance indices. We propose mutation operators for specific performance models, i.e., queueing networks, that resemble changes commonly made by designers when exploring the properties of a system's performance. Our approach consists in introducing a mutation-based approach that generates a set of mutated queueing network models. The performance of these mutated networks is compared to that of the original network to better understand the effect of variations in the different components of the system. A set of benchmarks is adopted to show how the technique can be used to get a deeper understanding of the performance characteristics of software systems. (c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Keywords:
Queueing Networks
Mutation
Model-based performance analysis
Journal
IF:
4.1
Papers:
5.5K
Citations:
8.4K
Organization
View more organizations
Cited Papers
Tongue thickness measured by ultrasonography is associated with tongue pressure in the Japanese elderly.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAIShareSaveShareSave
ShareSaveShareSave View more