Denna sida på svenska This page in English

Seminars and Events

All seminars are held at the Department of Automatic Control, in the seminar room M:2112B on the second floor in the M-building, unless stated otherwise.


PhD Defense at Automatic Control: Johan Ruuskanen


From: 2022-11-18 10:15 to 13:00
Place: Lecture hall KC:C in Kemicentrum, Naturvetarvägen 18, Lund.
Contact: anton [dot] cervin [at] control [dot] lth [dot] se
Save event to your calendar

Johan Ruuskanen is defending his PhD thesis at the Department of Automatic Control.

Author: Johan Ruuskanen
Supervisor: Anton Cervin; Karl-Erik Årzen
Opponent: Reader Giuliano Casale, Imperial College London, UK
When: Friday 18th of Nov. at  10:15
Where: Lecture hall KC:C in Kemicentrum, Naturvetarvägen 18, Lund. 
LU Zoom meeting:
Title: Dynamical Modeling of Cloud Applications for Runtime Performance Management



Cloud computing has quickly grown to become an essential component in many modern-day software applications. It allows consumers, such as a provider of some web service, to quickly and on demand obtain the necessary computational resources to run their applications. It is desirable for these service providers to keep the running cost of their cloud application low while adhering to various performance constraints. This is made difficult due to the dynamics imposed by, e.g., resource contentions or changing arrival rate of users, and the fact that there exist multiple ways of influencing the performance of a running cloud application. To facilitate decision making in this environment, performance models can be introduced that relate the workload and different actions to important performance metrics.

In this thesis, such performance models of cloud applications are studied. In particular, we focus on modeling using queueing theory and on the fluid model for approximating the often intractable dynamics of the queue lengths. First, existing results on how the fluid model can be obtained from the mean-field approximation of a closed queueing network are simplified and extended to allow for mixed networks. The queues are allowed to follow the processor sharing or delay disciplines, and can have multiple classes with phase-type service times. An improvement to this fluid model is then presented to increase accuracy when the \emph{system size}, i.e., number of servers, initial population, and arrival rate, is small. Furthermore, a closed-form approximation of the response time CDF is presented. The methods are tested in a series of simulation experiments and shown to be accurate.

This mean-field fluid model is then used to derive a general fluid model for microservices with interservice delays. The model is shown to be completely extractable at runtime in a distributed fashion. It is further evaluated on a simple microservice application and found to accurately predict important performance metrics in most cases. Furthermore, a method is devised to reduce the cost of a running application by tuning load balancing parameters between replicas. The method is built on gradient stepping by applying automatic differentiation to the fluid model. This allows for arbitrarily defined cost functions and constraints, most notably including different response time percentiles. The method is tested on a simple application distributed over multiple computing clusters and is shown to reduce costs while adhering to percentile constraints.

Finally, modeling of request cloning is studied using the novel concept of synchronized service. This allows certain forms of cloning over servers, each modeled with a single queue, to be equivalently expressed as one single queue. The concept is very general regarding the involved queueing discipline and distributions, but instead introduces new, less realistic assumptions. How the equivalent queue model is affected by relaxing these assumptions is studied considering the processor sharing discipline, and an extension to enable modeling of speculative execution is made. In a simulation campaign, it is shown that these relaxations only has a minor effect in certain cases.