Irregular Graph Algorithms on Parallel Processing Systems
Student: George M. Slota (Pennsylvania State University)
Advisor: Kamesh Madduri (Pennsylvania State University)
Abstract: My dissertation research lies at the interface of high performance computing and big data analytics. Specifically, my work focuses on designing new parallel approaches for analyzing large real-world networks. The high complexity, scale, and variation of graph-structured data poses an immense challenge in the design of techniques to study and derive insight from such data. Optimizing graph analysis software for complex and heterogeneous modern HPC systems poses an additional set of challenges for algorithm designers to overcome. My primary research goals focus on tackling these problems through the optimization of graph analytics at all levels of hardware architecture, from thread to core to processor to single-node to multi-node to system-level scale. The fact that graph-structured data is so universal means that this research is useful to a large collection of data-intensive problems within both the social and physical sciences.
Doctoral Showcase Index