Characterizing betweenness centrality algorithm on multi-core architectures

Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009

Volumn , Issue , 2009, Pages 182-189

  Tu, Dengbiao ^a,b   Tan, Guangming ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BETWEENNESS CENTRALITY; GRAPH ANALYSIS; HIGH PERFORMANCE COMPUTING; IN-DEPTH ANALYSIS; MEMORY ACCESS; MULTICORE ARCHITECTURES;

COMPUTER SCIENCE; PARALLEL ARCHITECTURES;

DISTRIBUTED PARAMETER NETWORKS;

EID: 70449469145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPA.2009.18     Document Type: Conference Paper

References (21)

1. S. Vangal, J. Howard, G. Ruhl, S. Dighe, H. Wilson, J. Tschanz, D. Finan, P. Iyer, A. Singh, T. Jacob, S. Jain, S. Venkataraman, Y. Hoskote, and N. Borkar, "An 80-tile 1.28tflops network-on-chip in 65 nm cmos," in In Proceedings of IEEE International Solid-State Circuits Conference, 2007, pp. 98-589.
2. M. Denneau and H. S. Warren, Jr., "64-bit Cyclops: Principles of operation," Apr. 2005.
3. "www.gpgpu.org."
4. "www.clearspeed.com."
5. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and P. Chew, "Optimistic parallelism requires abstractions," in Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, 2007, pp. 211-222.
6. M. Smelyanskiy, V. W. Lee, D. Kim, A. Nguyen, and P. Dubey, "Scaling performance of interior-point method on large-scale chip multiprocessor system," in IEEE/ACM SC'07, 2007.
7. L. C. Freeman, "A set of measures of centrality based on betweenness," Sociomtry, vol. 40, no. 1, pp. 35-41, 1977.
8. A. del Sol, H. Fujihashi, and P. O'Meara, "Topology of small-world networks of protein-protein complex structures," Bioinformatics, vol. 21, no. 8, pp. 1311-1315, 2005.
9. H. Jeong, S. P. Mason, A.-L. Barabasi, and Z. N. Oltvai, "Lethality and centrality in protein networks," Nature, vol. 411, p. 41, 2001.
10. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Aberg, "The web of human sexual contacts," Nature, vol. 411, p. 907, 2001.
11. V. E. Krebs, "Mapping networks of terrorist cells," Connections, vol. 24, no. 3, pp. 43-52, 2002.
12. T. Coffman, S. Greenblatt, and S. Marcus, "Graph-based technologies for intelligence analysis," Communications of the ACM, vol. 47, no. 3, pp. 45-47, 2004.
13. U. Brandes, "A faster algorithm for betweenness centrality," Journal of Mathematical Socialogy, vol. 25, no. 2, pp. 163-177, 2001.
14. D. Alderson, J. C. Doyle, L. Li, and W. Willinger, "Towards a theory of scale-free graphs: Definition, properties, and implications," Internet Math, vol. 2, no. 4, pp. 431-523, 2005.
15. D. A. Bader, "Hpcs scalable synthetic compact applications 2 graph analysis," www.highproductivity.org/SSCABmks.htm, 2006.
16. D. A. Bader and K. Madduri, "Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2," in The 35th International Conference on Parallel Processing (ICPP 2006), 2006.
17. D. A. Bader and K. Madduri, "Parallel algorithms for evaluating centrality indices in real-world networks," in The 35th International Conference on Parallel Processing (ICPP 2006), 2006.
18. "www.highproductivity.org."
19. "http://www.graphanalysis.org/."
20. J. B. Dennis and D. P. Misunas, "A preliminary architecture for a basic data-flow processor," in ISCA '75: Proceedings of the 2nd annual symposium on Computer architecture. New York, NY, USA: ACM, 1975, pp. 126-132.
21. G. Tan and G. R. Gao, "A study of parallel betweenness centrality algorithm on a many-core architecture," University of Delaware, Tech. Rep., 2007.