David A. Bader
IEEE Fellow
AAAS Fellow
Professor
College of Computing
Georgia Tech
Atlanta, GA 30332


 
 

 

Analysis of Streaming Social Networks and Graphs on Multicore Architectures

Analyzing static snapshots of massive, graph-structured data cannot keep pace with the growth of social networks, financial transactions, and other valuable data sources. We introduce a framework, STING (Spatio-Temporal Interaction Networks and Graphs), and evaluate its performance on multicore, multisocket Intel ® -based platforms. STING achieves rates of around 100 000 edge updates per second on large, dynamic graphs with a single, general data structure. We achieve speedups of up to 1000× over parallel static computation, improve monitoring a dynamic graph's connected components, and show an exact algorithm for maintaining local clustering coefficients performs better on Intel-based platforms than our earlier approximate algorithm.

Publication History

Versions of this paper appeared as:
  1. E.J. Riedy, H. Meyerhenke, D.A. Bader, D. Ediger, and T. Mattson, ``Analysis of Streaming Social Networks and Graphs on Multicore Architectures,'' The 37th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Kyoto, Japan, March 25-30, 2012.

Download this report in Adobe PDF


 
 

Last updated: June 1, 2012

 




Computational Biology



Parallel Computing



Combinatorics