John Ardelius defends his PhD thesis

Title: On the Performance Analysis of Large Scale, Dynamic, Distributed and Parallel Systems
Respondent: John Ardelius

Opponent: Mark Jelasity
Supervisor: Supriya Krishnamurthy, Seif Haridi
Examination Committee: Peter Van Roy, Viktoria Fodor, Keijo Heljanko


Evaluating the performance of large distributed applications is an important and non-trivial task. With the onset of Internet wide applications there is an increasing need to quantify reliability, dependability and performance of these systems, both as a guide in system design as well as a means to understand the fundamental properties of large-scale distributed systems. Previous research has mainly focused on either formalized models where system properties can be deduced and verified using rigorous mathematics or on measurements and experiments on deployed applications. Our aim in this thesis is to study models on an abstraction level lying between the two ends of this spectrum. We adopt a model of distributed systems inspired by methods used in the study of large scale system of particles in physics and model the application nodes as a set of interacting particles each with an internal state whose actions are specified by the application program. We apply our modeling and performance evaluation methodology to four different distributed and parallel systems. The first system is the distributed hash table (DHT) Chord running in a dynamic environment.

The second type of system is an unstructured gossip protocol running a distributed version of the famous Belman-Ford algorithm.

The third is a content distribution network (CDN) of interconnected caches in an aggregation access network and the last system is a work stealing heuristic for task distribution in the TileraPro64 chip.

Tuesday, December 10, 2013, 10:00
Sal 431, KTH Forum, KTH-ICT
Isafjordsgatan 39