The Design and Analysis of an Elastic Scheduling System for Distributed Graph Processing
S.T. Au (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Alexandru Iosup – Mentor (TU Delft - Data-Intensive Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Graphs are versatile enough to model many problems, and we see them used for
solving a large spectrum of challenges in various disciplines. As the size of graph
data grew over the years, to satisfy the requirement to process large data sets on
time, distributed graph-processing systems were implemented.
However, these systems were built with a static deployment in mind, only allowing the systems to run on a pre-defined set of machines. Manual optimizations
and tweaks to deployment configurations lead to a waste of resources as well as an
increase in operational costs.
In this thesis, we explore the introduction of elastic deployment in distributed
graph-processing systems. We design and implement a distributed graph-processing
system and a framework for assessing elasticity and performing real-world experimentation.