Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
Software Architecture in Practice
Software Architecture in Practice
Model-Based Performance Prediction in Software Development: A Survey
IEEE Transactions on Software Engineering
An approach for QoS-aware service composition based on genetic algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Architecture-Based Software Reliability Analysis: Overview and Limitations
IEEE Transactions on Dependable and Secure Computing
The Palladio component model for model-driven performance prediction
Journal of Systems and Software
Consideration of Partial User Preferences in Evolutionary Multiobjective Optimization
Multiobjective Optimization
Quality Assessment of Pareto Set Approximations
Multiobjective Optimization
ArcheOpterix: An extendable tool for architecture optimization of AADL models
MOMPES '09 Proceedings of the 2009 ICSE Workshop on Model-Based Methodologies for Pervasive and Embedded Software
A framework for utility-based service oriented design in SASSY
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Rule-based automatic software performance diagnosis and improvement
Performance Evaluation
Using quality of service bounds for effective multi-objective software architecture optimization
Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems
Parameterized reliability prediction for component-based software architectures
QoSA'10 Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Deployment optimization of software objects by design-level delay estimation
The Journal of Supercomputing
Hi-index | 0.00 |
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.