Green-Marl: A DSL for easy and efficient graph analysis

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn , Issue , 2012, Pages 349-362

  Hong, Sungpack ^a   Chafi, Hassan ^a,b   Sedlar, Edic ^b   Olukotun, Kunle ^a  

^a STANFORD UNIVERSITY   (United States)

^b ORACLE CORPORATION   (United States)

Author keywords

domain specific language; graph; parallel programming

Indexed keywords

DATA-LEVEL PARALLELISM; DOMAIN SPECIFIC LANGUAGES; GRAPH; GRAPH ANALYSIS; HIGH LEVEL SEMANTICS; PARALLEL IMPLEMENTATIONS;

ALGORITHMS; PARALLEL PROGRAMMING; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; SEMANTICS;

FERTILIZERS;

EID: 84858785554     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2150976.2151013     Document Type: Conference Paper

References (38)

1. Green-marl lanaguage specification. http://ppl.stanford.edu/main/green- marl.html.
2. Pagerank c++ implementation. http://code.grnet.gr/projects/pagerank.
3. Strongly connected component (kosaraju) java implementation. http://www.keithschwarz.com/interesting/.
4. V. Agarwal, F. Petrini, D. Pasetto, and D. Bader. Scalable Graph Exploration on Multicore Processors. In ACM/IEEE SC 2010.
5. M. Anderson. Better benchmarking for supercomputers. Spectrum, IEEE, 48(1), 2011.
6. D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In ICPP 2006. IEEE.
7. D. Bader and K. Madduri. Parallel algorithms for evaluating centrality indices in real-world networks. In IEEE ICPP 2006.
8. D. 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 IEEE IPDPS, 2008.
9. D. A. Bader and K. Madduri. Snap: small-world network analysis and partitioning. http://snap-graph.sourceforge.net.
10. O. Bagge, K. Kalleberg, M. Haveraaen, and E. Visser. Design of the CodeBoost transformation system for domain-specific optimisation of C++ programs. In Source Code Analysis and Manipulation, 2003. Proceedings. Third IEEE International Workshop on.
11. O. Beckmann, A. Houghton, M. Mellor, and P. H. Kelly. Runtime code generation in c++ as a foundation for domain-specific optimisation. In Domain-Specific Program Generation, volume 3016 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2004.
12. B. Bollobás. Modern graph theory. Springer Verlag, 1998.
13. U. Brandes. A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology, 25(2):163-177, 2001. (Pubitemid 33398479)
14. H. Chafi, A. Sujeeth, K. Brown, H. Lee, A. Atreya, and K. Olukotun. A domain-specific approach to heterogeneous parallelism. In PPoPP. ACM, 2011.
15. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, 2004.
16. G. Cong and D. Bader. Lock-free parallel algorithms: An experimental study. High Performance Computing-HiPC 2004, 2005.
17. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT press and McGraw-Hill, 2001.
18. G. Csardi and T. Nepusz. The igraph software package for complex network research. InterJournal Complex Systems, 1695, 2006.
19. D. Gregor and A. Lumsdaine. The parallel bgl: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), 2005.
20. S. Z. Guyer and C. Lin. An annotation language for optimizing software libraries. In PLAN '99: Proceedings of the 2nd conference on Domain-specific languages.
21. S. Hong, S. Kim, T. Oguntebi, and K. Olukotun. Accelerating CUDA graph algorithms at maximum warp. In PPoPP, 2011.
22. S. Hong, T. Oguntebi, and K. Olukotun. Efficient parallel graph exploration for multi-core cpu and gpu. In IEEE PACT 2011.
23. P. Hudak. Building domain-specific embedded languages. ACM Computing Surveys, 28, 1996.
24. K. Kennedy, B. Broom, A. Chauhan, R. Fowler, J. Garvin, C. Koelbel, C. McCosh, and J. Mellor-Crummey. Telescoping languages: A system for automatic generation of domain languages. Proceedings of the IEEE, 93(3), 2005.
25. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. Hellerstein. Graphlab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence, 2010.
26. A. Lumsdaine, D. Gregor, B. Hendrickson, J. Berry, and J. Guest Editors. Challenges in parallel graph processing. Parallel Processing Letters, 17(1):5-20, 2007. (Pubitemid 46573923)
27. K. Madduri, D. Bader, J. Berry, and J. Crobak. Parallel shortest path algorithms for solving large-scale instances. 9th DIMACS Implementation Challenge-Shortest Paths, 2006.
28. K. Madduri, D. Ediger, K. Jiang, D. Bader, and D. Chavarria-Miranda. A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In IEEE IPDPS 2009.
29. 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 SIGMOD '10. ACM.
30. NVIDIA. CUDA. http://developer.nvidia.com/object/cuda.html.
31. OpenMP ARB. Openmp. http://www.openmp.org.
32. L. Page. Method for node ranking in a linked database, Sept. 4 2001. US Patent 6,285,999.
33. J. Siek, L. Lee, A. Lumsdaine, L. Lee, L. Blackford, J. Demmel, J. Dongarra, I. Duff, S. Hammarling, M. Heroux, et al. The boost graph library: user guide and reference manual. 2002.
34. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33, August 1990.
35. T. L. Veldhuizen. Expression templates, C++ gems. SIGS Publications, Inc., New York, NY, 1996.
36. T. L. Veldhuizen. Arrays in blitz++. In ISCOPE, pages 223-230, 1998.
37. T. L. Veldhuizen. Active Libraries and Universal Languages. PhD thesis, Indiana University Computer Science, May 2004.
38. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In SC 2005 ACM/IEEE.