DATE:
Thursday, September 15, 2016
TIME: 12:00 pm  1:00 pm
PLACE: RMCIC 4th Floor Panther Hollow Room
SPEAKER: Julian Shun,
UC Berkeley
TITLE: Parallel Local Graph Clustering
ABSTRACT:
Graph clustering has many important applications in computing, but due to growing sizes of graphs, even traditionally fast clustering methods such as spectral partitioning can be computationally expensive for realworld graphs of interest. Motivated partly by this, socalled local algorithms for graph clustering have received significant interest due to the fact that they can find good clusters in a graph with work proportional to the size of the cluster rather than that of the entire graph. This feature has proven to be crucial in making such graph clustering and many of its downstream applications efficient in practice. While local clustering algorithms are already faster than traditional algorithms that touch the entire graph, they are sequential and there is an opportunity to make them even more efficient via parallelization. In this talk, we show how to parallelize many of these algorithms in the sharedmemory multicore setting, and we analyze the parallel complexity of these algorithms. We present comprehensive experiments on largescale graphs showing that our parallel algorithms achieve good parallel speedups on a modern multicore machine, thus significantly speeding up the analysis of local graph clusters in the very largescale setting.
BIO:
Julian Shun is currently a Miller Research Fellow (postdoc) at UC Berkeley. He obtained his Ph.D. in Computer Science from Carnegie Mellon University, and his undergraduate degree in Computer Science from UC Berkeley. He is interested in developing largescale parallel algorithms for graph processing, and parallel text algorithms and data structures. He is also interested in designing methods for writing deterministic parallel programs and benchmarking parallel programs. He has received the ACM Doctoral Dissertation Award, CMU School of Computer Science Doctoral Dissertation Award, Miller Research Fellowship, Facebook Graduate Fellowship, and a best student paper award at the Data Compression Conference.
VISITOR HOSTS: Guy Blelloch, Phil Gibbons
VISITOR COORDINATOR: Jennifer Landefeld, jennsbl@cs.cmu.edu, 84740
SDI / ISTC SEMINAR QUESTIONS?
Karen Lindenfelser, 86716, or visit www.pdl.cmu.edu/SDI/
