Characterizing Betweenness Centrality Algorithm on Multi-core Architectures

This paper presents an in-depth analysis of characterization for an irregular application – computing betweenness centrality (BC) – on multi-core architectures. BC algorithm is widely used in large scale graph analysis applications, which play an increasingly important role in high performance computing community. Through a joint study of architecture and application, we find that dynamically non-contiguous memory access, unstructured parallelism and low arithmetic intensity in BC program pose an obstacle to an efficient execution on parallel architectures. The experimental results report a comparison between Intel Clovertown and Sun Niagara1 for running such irregular program. Finally, several implications on mulit-core architecture and programming are proposed.

[1]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[2]  David A. Bader,et al.  Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[3]  Keshav Pingali,et al.  Optimistic parallelism requires abstractions , 2007, PLDI '07.

[4]  Guang R. Gao,et al.  A Study of Parallel Betweenness Centrality Algorithm on a Manycore Architecture , 2007 .

[5]  Saurabh Dighe,et al.  An 80-Tile 1.28TFLOPS Network-on-Chip in 65nm CMOS , 2007, 2007 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[6]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[7]  Pradeep Dubey,et al.  Scaling performance of interior-point method on large-scale chip multiprocessor system , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[8]  Jack B. Dennis,et al.  A preliminary architecture for a basic data-flow processor , 1974, ISCA '75.

[9]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[10]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[11]  David A. Bader,et al.  Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[12]  Sherry Marcus,et al.  Graph-based technologies for intelligence analysis , 2004, CACM.

[13]  Antonio del Sol,et al.  Topology of small-world networks of protein?Cprotein complex structures , 2005, Bioinform..

[14]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[15]  Valdis E. Krebs,et al.  Mapping Networks of Terrorist Cells , 2001 .