MapGraph: A high level API for fast development of high performance graph analytics on GPUs

2nd International Workshop on Graph Data Management Experiences and Systems, GRADES 2014 - Co-located with SIGMOD/PODS 2014

Volumn , Issue , 2014, Pages

  Fu, Zhisong ^a   Personick, Michael ^a   Thompson, Bryan ^a  

^a SYSTAP   (United States)

Author keywords

GPU; Graph analytics; High level API

Indexed keywords

ABSTRACTING; INFORMATION MANAGEMENT; SCHEDULING;

ALGORITHMS AND DATA STRUCTURES; COALESCED MEMORY ACCESS; GPU; GRAPH ANALYTICS; HIGH-LEVEL ABSTRACTION; HIGH-LEVEL API; PROGRAMMING FRAMEWORK; SCHEDULING STRATEGIES;

PROGRAM PROCESSORS;

EID: 84905644956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2621934.2621936     Document Type: Conference Paper

References (15)

1. E. S.-N. Abdullah Gharaibeh, Lauro Beltrao Costa and M. Ripeanu. Totem: Accelerating graph processing on hybrid cpu+gpu systems. GPU Technology Conference, 2013.
2. S. Baxter. Modern gpu library. 2013. http://www.moderngpu.com/.
3. N. Bell and M. Garland. Efficient sparse matrix-vector multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation, Dec. 2008.
4. G. Chapuis, H. Djidjev, R. Andonov, S. Thulasidasan, and D. Lavenier. Efficient multi-gpu algorithm for all-pairs shortest paths. In IPDPS 2014, May 2014.
5. N. T. Duong, Q. A. P. Nguyen, A. T. Nguyen, and H.-D. Nguyen. Parallel pagerank computation using gpus. In Proceedings of the Third Symposium on Information and Communication Technology, SoICT '12, pages 223-230. ACM, 2012.
6. E. Elsen and V. Vaidyanathan. Vertexapi2 - A vertex-program api for large graph computations on the gpu. 2014. http://www.royal-caliber.com/vertexapi2. pdf.
7. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI'12, pages 17-30, Berkeley, CA, USA, 2012. USENIX Association.
8. S. Hong, H. Chafi, E. Sedlar, and K. Olukotun. Green-marl: A dsl for easy and efficient graph analysis. In Proceedings of the Seventeenth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS XVII, pages 349-362, New York, NY, USA, 2012. ACM.
9. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, July 2010.
10. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD '10, pages 135-146, New York, NY, USA, 2010. ACM.
11. D. Merrill, M. Garland, and A. Grimshaw. Scalable gpu graph traversal. In Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '12, pages 117-128, New York, NY, USA, 2012. ACM.
12. NVIDIA. Cuda programming guide. http://www.nvidia.com/object/cuda.html.
13. J. Soman, K. Kothapalli, and P. J. Narayanan. Some gpu algorithms for graph connected components and spanning tree. Parallel Processing Letters, 20(04):325-339, 2010.
14. G. Wang, W. Xie, A. J. Demers, and J. Gehrke. Asynchronous large-scale graph processing made easy. In CIDR, 2013.
15. J. Zhong and B. He. Medusa: Simplified graph processing on gpus. IEEE Transactions on Parallel and Distributed Systems, 99:1, 2013.