Repository logo
  • Log In
    Log in via Symplectic to deposit your publication(s).
Repository logo
  • Communities & Collections
  • Research Outputs
  • Statistics
  • Log In
    Log in via Symplectic to deposit your publication(s).
  1. Home
  2. Faculty of Engineering
  3. Computing
  4. Computing PhD theses
  5. Performance and cost optimization of multi-tenant in-memory database clusters
 
  • Details
Performance and cost optimization of multi-tenant in-memory database clusters
File(s)
Molka-K-2018-PhD-Thesis.pdf (3.43 MB)
Thesis
Author(s)
Molka, Karsten
Type
Thesis or dissertation
Abstract
In this thesis, we set focus on in-memory database systems and combine queueing network modeling with nonlinear optimization to capture their performance characteristics and to optimize their provisioning cost. Our work is motivated by the advances in big data processing and in-memory technologies, which have created a shift of resource usage patterns in data centers, making both resource and workload management more challenging. One reason for this lies in the complexity of in-memory applications, for which performance is difficult to capture with existing methods. These challenges are further exacerbated by on-demand database offerings and multi-tenant configurations, both of which can lead to increased workload dynamics. New accurate and efficient performance management methods are therefore key to handle workload interference effects and improve suboptimal resource configuration in data centers.

The first part of this thesis proposes a methodology that tackles the above challenges by solving the problem of routing analytical requests to a set of in-memory databases, minimizing memory exhaustion. This is particularly important, in that it helps avoid memory swapping under workloads with large memory footprints. As part of our methodology, we also introduce a novel in-memory database performance model based on fork-join queues, which compared with existing approximations is both more accurate and suitable for large scale optimization.

In the second part we focus on the performance analysis and resource allocation challenges that in-memory database providers face when optimizing their data center environments for large multi-tenant workloads. We set out by analyzing performance interference between multiple co-located databases and propose efficient models for capturing power consumption and probabilistic measures of memory occupancy. We then combine these models with a novel optimization strategy that tackles database consolidation problems with a new hybrid genetic algorithm, and we demonstrate its effectiveness in helping cloud providers increase the energy-efficiency of in-memory database clusters.
Version
Open Access
Date Issued
2017-04
Date Awarded
2018-03
URI
http://hdl.handle.net/10044/1/58930
DOI
https://doi.org/10.25560/58930
Copyright Statement
Attribution NoDerivatives 4.0 International Licence (CC BY-ND)
License URL
https://creativecommons.org/licenses/by-nc-nd/4.0/
Advisor
Casale, Giuliano
Heinis, Thomas
Sponsor
SAP (Firm)
Publisher Department
Computing
Publisher Institution
Imperial College London
Qualification Level
Doctoral
Qualification Name
Doctor of Philosophy (PhD)
About
Spiral Depositing with Spiral Publishing with Spiral Symplectic
Contact us
Open access team Report an issue
Other Services
Scholarly Communications Library Services
logo

Imperial College London

South Kensington Campus

London SW7 2AZ, UK

tel: +44 (0)20 7589 5111

Accessibility Modern slavery statement Cookie Policy

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback