|Rieger, Lukas: Distributed graph partitioning for large-scale graph analytics. |
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Bachelorarbeit (2016).
97 Seiten, englisch.
|CR-Klassif.||G.2.2 (Discrete Mathematics Graph Theory)|
Through constant technical progress the amount of available data about almost anything is growing steadily. Since hardware has become very cheap in the last decades, it is also possible to store and process huge amounts of data. Moreover companies like Google have sprung up that generate a large part of their revenues by extracting valuable information from collected data. A common approach to compute large inputs efficiently is to use a distributed system and concurrent algorithms. Therefore it is necessary to distribute the data to be processed intelligently among the cores or machines. Thereby the distribution of the input has strong effects on the efficiency of algorithms processing it. Furthermore data which can be represented as graph is ubiquitous, Facebook and the world wide web are well known examples of it. In this case, graph partitioning algorithms are used to distribute the input data in the best possible way. Since graph partitioning is a NP-hard problem, heuristic methods have to be used to keep execution time within reasonable bounds. This thesis presents and analyses a divide-and-conquer based framework for graph partitioning which aims to approximate linear runtime with better partitioning results than linear time algorithms.
|PDF (1247863 Bytes)|
|Abteilung(en)||Universität Stuttgart, Institut für Parallele und Verteilte Systeme, Verteilte Systeme|
|Betreuer||Rothermel, Prof. Kurt; Mayer, Christian; Tariq, Dr. Adnan|
|Eingabedatum||26. September 2018|