Automatic Performance Space Exploration of Web Applications using Genetic Algorithms

Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

2 Citations (Scopus)

Abstract

We describe a tool-supported performance exploration approach in which we use genetic algorithms to find a potential user behavioural pattern that maximizes the resource utilization of the system under test. This work is built upon our previous work in which we generate load from workload models that describe the expected behaviour of the users. In this paper, we evolve a given probabilistic workload model (specified as a Markov Chain Model) by optimizing the probability distribution of the edges in the model and generating different solutions. During the evolution, the solutions are ranked according to their fitness values. The solutions with the highest fitness are chosen as parent solutions for generating offsprings. At the end of an experiment, we select the best solution among all the generations. We validate our approach by generating load from both the original and the best solution model, and by comparing the resource utilization they create on the system under test.
Original languageUndefined/Unknown
Title of host publicationSAC '16 Proceedings of the 31st Annual ACM Symposium on Applied Computing
EditorsSascha Ossowski, Giorgio Buttazzo, John Kim
PublisherACM
Pages795–800
ISBN (Print)978-1-4503-3739-7
DOIs
Publication statusPublished - 2016
MoE publication typeA4 Article in a conference publication
EventSymposium on Applied Computing, SAC - SAC '16 Symposium on Applied Computing
Duration: 4 Apr 20168 Apr 2016

Conference

ConferenceSymposium on Applied Computing, SAC
Period04/04/1608/04/16

Keywords

  • Markov Chain model
  • Performance exploration
  • genetic algorithms
  • performance testing

Cite this