{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:20:50Z","timestamp":1780590050823,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,3]],"date-time":"2012-03-03T00:00:00Z","timestamp":1330732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,3]]},"DOI":"10.1145\/2150976.2151013","type":"proceedings-article","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T08:18:26Z","timestamp":1331021906000},"page":"349-362","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":164,"title":["Green-Marl"],"prefix":"10.1145","author":[{"given":"Sungpack","family":"Hong","sequence":"first","affiliation":[{"name":"Stanford University, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hassan","family":"Chafi","sequence":"additional","affiliation":[{"name":"Stanford University & Oracle Labs, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edic","family":"Sedlar","sequence":"additional","affiliation":[{"name":"Oracle Labs, Belmont, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunle","family":"Olukotun","sequence":"additional","affiliation":[{"name":"Stanford University, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,3,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Green-marl lanaguage specification. http:\/\/ppl.stanford.edu\/main\/green_marl.html.  Green-marl lanaguage specification. http:\/\/ppl.stanford.edu\/main\/green_marl.html."},{"key":"e_1_3_2_1_2_1","unstructured":"Pagerank c+ implementation. http:\/\/code.grnet.gr\/projects\/pagerank.  Pagerank c+ implementation. http:\/\/code.grnet.gr\/projects\/pagerank."},{"key":"e_1_3_2_1_3_1","unstructured":"Strongly connected component (kosaraju) java implementation. http:\/\/www.keithschwarz.com\/interesting\/.  Strongly connected component (kosaraju) java implementation. http:\/\/www.keithschwarz.com\/interesting\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2011.5676366"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.57"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"e_1_3_2_1_9_1","unstructured":"D. A. Bader and K. Madduri. Snap: small-world network analysis and partitioning. http:\/\/snap-graph.sourceforge.net.  D. A. Bader and K. Madduri. Snap: small-world network analysis and partitioning. http:\/\/snap-graph.sourceforge.net."},{"key":"e_1_3_2_1_10_1","volume-title":"Source Code Analysis and Manipulation, 2003. Proceedings. Third IEEE International Workshop on.","author":"Bagge O.","unstructured":"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. 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."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25935-0_17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941561"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30474-6_54"},{"key":"e_1_3_2_1_17_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT press and McGraw-Hill , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT press and McGraw-Hill, 2001."},{"key":"e_1_3_2_1_18_1","first-page":"1695","article-title":"The igraph software package for complex network research","author":"Csardi G.","year":"2006","unstructured":"G. Csardi and T. Nepusz . The igraph software package for complex network research . InterJournal Complex Systems , 1695 , 2006 . G. Csardi and T. Nepusz. The igraph software package for complex network research. InterJournal Complex Systems, 1695, 2006.","journal-title":"InterJournal Complex Systems"},{"key":"e_1_3_2_1_19_1","volume-title":"Parallel Object-Oriented Scientific Computing (POOSC)","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The parallel bgl: A generic library for distributed graph computations . Parallel Object-Oriented Scientific Computing (POOSC) , 2005 . D. Gregor and A. Lumsdaine. The parallel bgl: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/331960.331970"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941590"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/242224.242477"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840447"},{"key":"e_1_3_2_1_25_1","volume-title":"Conference on Uncertainty in Artificial Intelligence","author":"Low Y.","year":"2010","unstructured":"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 . 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."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_27_1","volume-title":"9th DIMACS Implementation Challenge-Shortest Paths","author":"Madduri K.","year":"2006","unstructured":"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 . 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."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_30_1","unstructured":"NVIDIA. CUDA. http:\/\/developer.nvidia.com\/object\/cuda.html.  NVIDIA. CUDA. http:\/\/developer.nvidia.com\/object\/cuda.html."},{"key":"e_1_3_2_1_31_1","unstructured":"OpenMP ARB. Openmp. http:\/\/www.openmp.org.  OpenMP ARB. Openmp. http:\/\/www.openmp.org."},{"key":"e_1_3_2_1_32_1","volume-title":"Sept. 4","author":"Page L.","year":"2001","unstructured":"L. Page . Method for node ranking in a linked database , Sept. 4 2001 . US Patent 6,285,999. L. Page. Method for node ranking in a linked database, Sept. 4 2001. US Patent 6,285,999."},{"key":"e_1_3_2_1_33_1","volume-title":"The boost graph library: user guide and reference manual","author":"Siek J.","year":"2002","unstructured":"J. Siek , L. Lee , A. Lumsdaine , L. Lee , L. Blackford , J. Demmel , J. Dongarra , I. Duff , S. Hammarling , M. Heroux , The boost graph library: user guide and reference manual . 2002 . 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."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_35_1","volume-title":"C+ gems","author":"Veldhuizen T. L.","year":"1996","unstructured":"T. L. Veldhuizen . Expression templates , C+ gems . SIGS Publications, Inc. , New York, NY , 1996 . T. L. Veldhuizen. Expression templates, C+ gems. SIGS Publications, Inc., New York, NY, 1996."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646894.709708"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"}],"event":{"name":"ASPLOS'12: Seventeenth International Conference on Architectural Support for Programming Languages and Operating Systems","location":"London England, UK","acronym":"ASPLOS'12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2150976.2151013","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2150976.2151013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:54:44Z","timestamp":1750226084000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2150976.2151013"}},"subtitle":["a DSL for easy and efficient graph analysis"],"short-title":[],"issued":{"date-parts":[[2012,3,3]]},"references-count":37,"alternative-id":["10.1145\/2150976.2151013","10.1145\/2150976"],"URL":"https:\/\/doi.org\/10.1145\/2150976.2151013","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2189750.2151013","asserted-by":"object"},{"id-type":"doi","id":"10.1145\/2248487.2151013","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,3,3]]},"assertion":[{"value":"2012-03-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}