Cusha: Vertex-centric graph processing on GPUs

HPDC 2014 - Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing

Volumn , Issue , 2014, Pages 239-251

  Khorasani, Farzad ^a   Vora, Keval ^a   Gupta, Rajiv ^a   Bhuyan, Laxmi N ^a  

^a University of California Riverside   (United States)

Author keywords

Coalesced memory accesses; Concatenated Windows; G Shards; GPU; Graph representation

Indexed keywords

ALGORITHMS; PROGRAM PROCESSORS;

ASYNCHRONOUS PARALLELISM; COALESCED MEMORY ACCESS; COMPRESSED SPARSE ROW; G-SHARDS; GPU; GRAPH REPRESENTATION; PARALLEL PROCESSING; STREAMING MULTIPROCESSORS;

GRAPH THEORY;

EID: 84904412583     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2600212.2600227     Document Type: Conference Paper

References (30)

1. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader. Scalable graph exploration on multicore processors. In SC, pages 1-11, 2010.
2. D. A. Bader and K. Madduri. Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks. In IPDPS, pages 1-12, 2008.
3. A. Bakhoda, G. Yuan, W. Fung, H. Wong, and T. Aamodt. Analyzing cuda workloads using a detailed gpu simulator. In ISPASS, pages 163-174, 2009.
4. J. Barnat, P. Bauch, L. Brim, and M. Ceska. Computing strongly connected components in parallel on cuda. In IPDPS, pages 544-555, 2011.
5. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In In SDM, 2004.
6. S. Che, J. Sheaffer, and K. Skadron. Dymaxion: Optimizing memory access patterns for heterogeneous systems. In SC, pages 1-11, 2011.
7. M. De Domenico, A. Lima, P. Mougel, and M. Musolesi. The anatomy of a scientific rumor. Scientific Reports, 2013.
8. A. Gharaibeh, L. Beltrao Costa, E. Santos-Neto, and M. Ripeanu. A yoke of oxen and a thousand chickens for heavy lifting graph processing. In PACT, pages 345-354, 2012.
9. A. Gharaibeh, L. Beltrao Costa, E. Santos-Neto, and M. Ripeanu. Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems. In CoRR, 2013.
10. P. Harish and P. J. Narayanan. Accelerating large graph algorithms on the gpu using cuda. In HiPC, pages 197-208, 2007.
11. M. Harris et al. Optimizing parallel reduction in cuda. NVIDIA Developer Technology, 2, 2007.
12. S. Hong, S. K. Kim, T. Oguntebi, and K. Olukotun. Accelerating cuda graph algorithms at maximum warp. In PPoPP, pages 267-276, 2011.
13. S. Hong, T. Oguntebi, and K. Olukotun. Efficient parallel graph exploration on multi-core cpu and gpu. In PACT, 2011.
14. A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In OSDI, pages 31-46, 2012.
15. J. Leskovec. Stanford large network dataset collection. http://snap. stanford.edu/data/index.html, 2011.
16. J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. ACM Trans. Web, 1(1), May 2007.
17. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR, abs/0810.1355, 2008.
18. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17(01):5-20, 2007.
19. L. Luo, M. Wong, and W.-m. Hwu. An effective gpu implementation of breadth-first search. In DAC, pages 52-55, 2010.
20. M. Mendez-Lojo, M. Burtscher, and K. Pingali. A gpu implementation of inclusion-based points- to analysis. In PPoPP, pages 107-116, 2012.
21. D. Merrill, M. Garland, and A. Grimshaw. Scalable gpu graph traversal. In PPoPP, pages 117-128, 2012.
22. R. Nasre, M. Burtscher, and K. Pingali. Morph algorithms on gpus. In PPoPP, pages 147-156, 2013.
23. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, 1999.
24. M. Samadi, A. Hormati, M. Mehrara, J. Lee, and S. Mahlke. Adaptive input-aware compilation for graphics engines. In PLDI, pages 13-22, 2012.
25. L. Takac and M. Zabovsky. Data analysis in public social networks. In International Scientific Conference and International Workshop Present Day Trends of Innovations, 2012.
26. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
27. B. Wu, Z. Zhao, E. Z. Zhang, Y. Jiang, and X. Shen. Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on gpu. In PPoPP, pages 57-68, 2013.
28. T. Wu, B. Wang, Y. Shan, F. Yan, Y. Wang, and N. Xu. Efficient pagerank and spmv computation on amd gpus. In ICPP, pages 81-89, 2010.
29. E. Z. Zhang, Y. Jiang, Z. Guo, K. Tian, and X. Shen. On-the-fly elimination of dynamic irregularities for gpu computing. In ASPLOS, pages 369-380, 2011.
30. J. Zhong, and B. He. Medusa: Simplified Graph Processing on GPUs. In IEEE Transactions on Parallel and Distributed Systems, 2013.