Pannotia: Understanding irregular GPGPU graph applications

Proceedings - 2013 IEEE International Symposium on Workload Characterization, IISWC 2013

Volumn , Issue , 2013, Pages 185-195

  Che, Shuai ^a   Beckmann, Bradford M ^a   Reinhardt, Steven K ^a   Skadron, Kevin ^b  

^a AMD Research and Computer Science   (United States)

^b UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS PATTERNS; DATA-PARALLEL APPLICATIONS;

PROGRAM PROCESSORS;

EID: 84893628986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IISWC.2013.6704684     Document Type: Conference Paper

References (43)

1. AMD Radeon HD 7000 series counters. Web resource. http: //developer.amd.com/tools/heterogeneous-computing/amd-app-profiler/ user- guide/app- profiler- settings/.
2. The 10th DIMACS Implementation Challenge Graph Partitioning and Graph Clustering. Web resource. http://www.cc.gatech.edu/dimacslO/.
3. The 9th DIMACS Implementation Challenge Shortest Paths. Web resource. http://www.dis.uniromal.it/challenge9/.
4. AMD Accelerated Parallel Processing: OpenCL Programming Guide. Web resource.
5. http://developer.amd.com/download/AMD-Accelerated- Parallel-Processing- OpenCL-Programming-Guide.pdf AMD Graphics Core Next Architecture. Web resource. http://www.amd. com/us/products/technologies/gcn/Pages/gcn-architecture.aspx.
6. M. Bastian, S. Heymann, and M. Jacomy. Gephi: An open source software for exploring and manipulating networks. In ICWSM, May 2009.
7. C. Bienia, S. Kumar, and K. Li. PARSEC vs. SPLASH-2: A quantitative comparison of two multithreaded benchmark suites on chip-multiprocessors. In IISWC, Sep 2008.
8. C. Bienia and K. Li. Fidelity and scaling of the PARSEC benchmark inputs. In IISWC, Dec 2010
9. Ulrik Brandes. A faster algorithm for betweenness centrality. 1. Math. Social., 25:163-177, 2001.
10. M. Burtscher, R. Nasre, and K. Pingali. A quantitative study ofirregular programs on GPUs. In IISWC, Nov 2012.
11. M. Burtscher and K. Pingali. An efficient CUDA implementation of the tree-based Barnes Hut n-body algorithm. In GPU Computing Gems, pages 75-92. Morgan Kaufmann, 2011.
12. S. Che, M. Boyer, J. Meng, D. Tarjan, J. W. Sheaffer, S-H. Lee, and K. Skadron. Rodinia: A benchmark suite for heterogeneous computing. In IISWC, Oct 2009.
13. S. Che, J. W. Sheaffer, M. Boyer, L. G. Szafaryn, L. Wang, and K. Skadron. A characterization of the Rodinia benchmark suite with comparison to contemporary CMP workloads. In IISWC, Dec 2010.
14. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill, 2nd edition, 2001.
15. A. Danalis, G. Marin, C. McCurdy, J. S. Meredith, P. C. Roth, K. Spafford, V. Tipparaju, and J. S. Vetter. The scalable HeterOgeneous computing (SHOC) benchmark suite. In GPGPU, Mar 2010.
16. L. Eeckhout, H. Vandierendonck, and K. D. Bosschere. Workload design: Selecting representative program-input pairs. In PACT, Sept 2002.
17. N. Goswami, R. Shankar, M. Joshi, and Tao Li. Exploring gpgpu workloads: Characterization methodology, analysis and microarchitecture evaluation implication. In IISWC, Dec 2010.
18. NVIDIA CUDA Programming Guide. Web resource. http://developer. nvidia.com/object/gpucomputing.html.
19. P. Harish and P. Narayanan. Accelerating large graph algorithms on the GPU using CUDA. In HiPC, Dec 2007.
20. K. Hoste and L. Eeckhout. Microarchitecture-independent workload characterization. IEEE Micro, 27(3):63-72, 2007.
21. J. Cohen and P. Castonguay. Efficient graph matching and coloring on the gpu. http://developer.download.nvidia.com/GTC/PDF/GTC2012/ PresentationPDF/ S0332-GTC2012-Graph-Coloring-GPU.pdf.
22. A. Joshi, A. Phansalkar, L. Eeckhout, and L. K. John. Measuring benchmark similarity using inherent program characteristics. IEEE Trans. Comp, 55(6):769-782, 2006.
23. O. Kalentev, A. Rai, S. Kemnitz, and R. Schneider. Connected component labeling on a 2D grid using CUDA. J. Parallel and Dist. Comp., 71(4):615-620, 2011.
24. A. Kerr, G. Diamos, and S. Yalamanchili. A characterization and analysis of PTX kernels. In IISWC, Oct 2009.
25. A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In OSDI, Oct 2012.
26. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new parallel framework for machine learning. In UAI, July 2010.
27. M. Luby. A simple parallel algorithm for the maximal independent set problem. In STOC, May 1985.
28. G. Malewicz, M. H. Austern, A. J.C Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, June 2010.
29. Matrix Market Format. Web resouce. http://math.nist.gov/MatrixMarket/ formats.html.
30. J. Meng, J. W. Sheaffer, and K. Skadron. Robust SIMD: Dynamically adapted simd width and multi-threading depth. In IPDPS, May 2012.
31. J. Meng, D. Tarjan, and K. Skadron. Dynamic warp subdivision for integrated branch and memory divergence tolerance. In ISCA, June 2010
32. D. G. Merrill, M. Garland, and A. S. Grimshaw. Scalable GPU graph traversal. In PPoPP, Feb 2012.
33. METIS File Format. Web resource. http://people.sc.fsu.edu/~jburkardt/ data/metis-graph/metis-graph.html.
34. GTGraph: A Suite of Synthetic Random Graph Generators. Web resource. http://www.cse.psu.edu/~madduri/software/GTgraph/index. html.
35. V. M. A. Oliveira and R. A. Lotufo. A study on connected components labeling algorithms using GPUs. In SIBGRAFI, Aug 2010.
36. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report SIDL-WP-1999- 01204, Stanford Univerisity, 1999
37. A. Phansalkar, A. Joshi, and L. K. John. Analysis of redundancy and application balance in the SPEC CPU2006 benchmark suite. In 1SCA, June 2007.
38. AFDS 2012 Phil Rogers Keynote: The programmer's guide to a universe of possibility. Web resource. http://hsafoundation.com/ publications/.
39. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan primitives for GPU computing. In GH, Aug 2007
40. Z. Shi and B. Zhang. Fast network centrality analysis using gpus. BMC Bioinformatics, 12(140), 2011
41. Parboil Benchmark suite. Web resource. http://impact.crhc.illinois.edu/ parboil.php.
42. The University of Florida Sparse Matrix Collection. Web resource. http: IIwww.cise.u8.edu/research/sparse/matrices/.
43. V. Vineet, P. Harish, S. Patidar, and P. J. Narayanan. Fast minimum spanning tree for large graphs on the GPU. In HPG, Jul 2009.