Koziolek, Anne; Noorshams, Qais; Reussner, Ralf (2011). Focussing multi-objective software architecture optimization using quality of service bounds. In: Dingel, Juergen; Solberg, Arnor. Models in Software Engineering. Berlin / Heidelberg, 384-399. ISBN 978-3-642-21209-3.
Full text not available from this repository.
Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds.To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25% on average.
|Item Type:||Book Section, refereed, original work|
|Communities & Collections:||03 Faculty of Economics > Department of Informatics|
|DDC:||000 Computer science, knowledge & systems|
|Deposited On:||09 Feb 2012 17:21|
|Last Modified:||23 Nov 2012 14:09|
|Series Name:||Lecture Notes in Computer Science|
|ISSN:||0302-9743 (P) 1611-3349 (E)|
|Other Identification Number:||merlin-id:3925|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page