{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:40:40Z","timestamp":1785955240949,"version":"3.56.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,7]]},"abstract":"<jats:p>Given the growing importance of large-scale graph analytics, there is a need to improve the performance of graph analysis frameworks without compromising on productivity. GraphMat is our solution to bridge this gap between a user-friendly graph analytics framework and native, hand-optimized code. GraphMat functions by taking vertex programs and mapping them to high performance sparse matrix operations in the backend. We thus get the productivity benefits of a vertex programming framework without sacrificing performance. GraphMat is a single-node multicore graph framework written in C++ which has enabled us to write a diverse set of graph algorithms with the same effort compared to other vertex programming frameworks. GraphMat performs 1.1-7X faster than high performance frameworks such as GraphLab, CombBLAS and Galois. GraphMat also matches the performance of MapGraph, a GPU-based graph framework, despite running on a CPU platform with significantly lower compute and bandwidth resources. It achieves better multicore scalability (13-15X on 24 cores) than other frameworks and is 1.2X off native, hand-optimized code on a variety of graph algorithms. Since GraphMat performance depends mainly on a few scalable and well-understood sparse matrix operations, GraphMat can naturally benefit from the trend of increasing parallelism in future hardware.<\/jats:p>","DOI":"10.14778\/2809974.2809983","type":"journal-article","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T14:37:34Z","timestamp":1438267054000},"page":"1214-1225","source":"Crossref","is-referenced-by-count":252,"title":["GraphMat"],"prefix":"10.14778","volume":"8","author":[{"given":"Narayanan","family":"Sundaram","sequence":"first","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadathur","family":"Satish","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md Mostofa Ali","family":"Patwary","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subramanya R.","family":"Dulloor","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael J.","family":"Anderson","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satya Gautam","family":"Vadlamudi","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dipankar","family":"Das","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pradeep","family":"Dubey","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Apache giraph. http:\/\/giraph.apache.org\/.  Apache giraph. http:\/\/giraph.apache.org\/."},{"key":"e_1_2_1_2_1","unstructured":"Apache spark. https:\/\/spark.apache.org\/.  Apache spark. https:\/\/spark.apache.org\/."},{"key":"e_1_2_1_3_1","unstructured":"Combinatorial Blas v 1.3. http:\/\/gauss.cs.ucsb.edu\/aydin\/CombBLAS\/html\/.  Combinatorial Blas v 1.3. http:\/\/gauss.cs.ucsb.edu\/aydin\/CombBLAS\/html\/."},{"key":"e_1_2_1_4_1","unstructured":"Galois v 2.2.0. http:\/\/iss.ices.utexas.edu\/?p=projects\/galois\/download.  Galois v 2.2.0. http:\/\/iss.ices.utexas.edu\/?p=projects\/galois\/download."},{"key":"e_1_2_1_5_1","unstructured":"Graphlab v 2.2. http:\/\/graphlab.org.  Graphlab v 2.2. http:\/\/graphlab.org."},{"key":"e_1_2_1_6_1","unstructured":"SciDB. http:\/\/www.scidb.org.  SciDB. http:\/\/www.scidb.org."},{"key":"e_1_2_1_7_1","volume-title":"http:\/\/dimacs.rutgers.edu\/Challenges\/","year":"2014"},{"key":"e_1_2_1_8_1","volume-title":"The Netflix Prize. In KDD Cup and Workshop at ACM SIGKDD","author":"Bennett J.","year":"2007"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_2_1_12_1","volume-title":"Scaling apache giraph to a trillion edges. www.facebook.com\/notes\/facebook-engineering\/scaling-apache-giraph-to-a-trillion-edges\/10151617006153920","author":"Ching A.","year":"2013"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621936"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S233"},{"key":"e_1_2_1_18_1","volume-title":"Dec.","author":"Jindal A.","year":"2014"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_2_1_22_1","volume-title":"UAI","author":"Low Y.","year":"2010"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670338"},{"key":"e_1_2_1_24_1","volume-title":"Introducing the graph 500","author":"Murphy R. C.","year":"2010"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941884"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610518"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544832"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556572"},{"key":"e_1_2_1_31_1","volume-title":"Teletraffic Congress, 2009","author":"Tizghadam A.","year":"2009"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519089"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.138"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.31"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2809974.2809983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:47:27Z","timestamp":1672224447000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2809974.2809983"}},"subtitle":["high performance graph analytics made productive"],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":35,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["10.14778\/2809974.2809983"],"URL":"https:\/\/doi.org\/10.14778\/2809974.2809983","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}