Topology-aware distributed graph processing for tightly-coupled clusters

Cloud applications have burgeoned over the last few years, but they are typically written for loosely-coupled clusters such as datacenters. In this thesis we investigate how one can run cloud applications in tightly-coupled clusters and network topologies, namely super-computers. Specifically, we look at a class of distributed machine learning systems called distributed graph processing systems, and run them on NCSA Blue Waters. Partitioning the graph is key to achieving performance in distributed graph processing systems. We present new topology-aware partitioning techniques that better exploit the structure of the network topologies in supercomputers. Compared to existing work, our new Restricted Oblivious and Grid Centroid partitioning approaches produce 25-33% improvement in makespan, along with a sizable reduction in network traffic. We also discuss optimizations such as smart network buffers that further amplify the improvement. To help operators select the best graph partitioning technique, we culminate our experimental results into a decision tree.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2018

Author dc:creator

• Bhatt, Mayank

Contributors dc:contributor

• Gupta, Indranil

• graph processing
• supercomputers
• topology

Statement dc:rights

• Copyright 2018 Mayank Bhatt

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/101213

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/101213