High performance computing for irregular algorithms and applications with an emphasis on big data analytics

Graph algorithms;Social network analysis;Parallel algorithms;High performance computing;Dynamic data

Green, Oded ; Bader, David A. Computational Science and Engineering Vuduc, Richard Aluru, Srinivas Chau, Duen Horng (Polo) Hong, Bo Birk, Yitzhak ; Bader, David A.

University:Georgia Institute of Technology

Department:Computational Science and Engineering

关键词: Graph algorithms;    Social network analysis;    Parallel algorithms;    High performance computing;    Dynamic data;   

Others  :  https://smartech.gatech.edu/bitstream/1853/51860/1/GREEN-DISSERTATION-2014.pdf

美国|英语

来源: SMARTech Repository

【 摘 要 】

Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present numerous programming challenges, including scalability, load balancing, and efficient memory utilization. In this age of Big Data we face additional challenges since the data is often streaming at a high velocity and we wish to make near real-time decisions for real-world events. For instance, we may wish to track Twitter for the pandemic spread of a virus. Analyzing such data sets requires combing algorithmic optimizations and utilization of massively multithreaded architectures, accelerator such as GPUs, and distributed systems. My research focuses upon designing new analytics and algorithms for the continuous monitoring of dynamic social networks. Achieving high performance computing for irregular algorithms such as Social Network Analysis (SNA) is challenging as the instruction flow is highly data dependent and requires domain expertise.The rapid changes in the underlying network necessitates understanding real-world graph properties such as the small world property, shrinking network diameter, power law distribution of edges, and the rate at which updates occur. These properties, with respect to a given analytic, can help design load-balancing techniques, avoid wasteful (redundant) computations, and create streaming algorithms. In the course of my research I have considered several parallel programming paradigms for a wide range systems of multithreaded platforms: x86, NVIDIA's CUDA, Cray XMT2, SSE-SIMD, and Plurality's HyperCore. These unique programming models require examination of the parallel programming at multiple levels: algorithmic design, cache efficiency, fine-grain parallelism, memory bandwidths, data management, load balancing, scheduling, control flow models and more. This thesis deals with these issues and more.