乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:45:03Z","timestamp":1746283503713,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,13]]},"DOI":"10.1145\/3225058.3225122","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"1-11","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Implementing Push-Pull Efficiently in GraphBLAS"],"prefix":"10.1145","author":[{"given":"Carl","family":"Yang","sequence":"first","affiliation":[{"name":"University of California, Davis Lawrence Berkeley National Laboratory"}]},{"given":"Ayd\u0131n","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory"}]},{"given":"John D.","family":"Owens","sequence":"additional","affiliation":[{"name":"University of California, Davis"}]}],"member":"320","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M104253X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.76"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"Bader David A","key":"e_1_3_2_1_4_1","unstructured":"David A Bader , Henning Meyerhenke , Peter Sanders , Christian Schulz , Andrea Kappes , and Dorothea Wagner . 2014. Benchmarking for graph clustering and partitioning . In Encyclopedia of Social Network Analysis and Mining . Springer , 73--82. David A Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, and Dorothea Wagner. 2014. Benchmarking for graph clustering and partitioning. In Encyclopedia of Social Network Analysis and Mining. Springer, 73--82."},{"key":"e_1_3_2_1_5_1","unstructured":"Sean Baxter. 2015. Modern GPU Library. http:\/\/nvlabs.github.io\/moderngpu\/. (2015). Sean Baxter. 2015. Modern GPU Library. http:\/\/nvlabs.github.io\/moderngpu\/. (2015)."},{"key":"e_1_3_2_1_6_1","unstructured":"Scott Beamer. 2018. Direction-Optimizing Breadth-First Search. http:\/\/gap.cs.berkeley.edu\/dobfs.html. (2018). Scott Beamer. 2018. Direction-Optimizing Breadth-First Search. http:\/\/gap.cs.berkeley.edu\/dobfs.html. (2018)."},{"key":"e_1_3_2_1_7_1","volume-title":"Direction-optimizing Breadth-First Search. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--10","author":"Beamer Scott","year":"2012","unstructured":"Scott Beamer , Krste Asanovic , and David Patterson . 2012 . Direction-optimizing Breadth-First Search. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--10 . Scott Beamer, Krste Asanovic, and David Patterson. 2012. Direction-optimizing Breadth-First Search. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--10."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.112"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_12_1","volume-title":"Design of the GraphBLAS API for C. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 643--652","author":"Bulu\u00e7 Aydin","year":"2017","unstructured":"Aydin Bulu\u00e7 , Tim Mattson , Scott McMillan , Jos\u00e9 Moreira , and Carl Yang . 2017 . Design of the GraphBLAS API for C. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 643--652 . Aydin Bulu\u00e7, Tim Mattson, Scott McMillan, Jos\u00e9 Moreira, and Carl Yang. 2017. Design of the GraphBLAS API for C. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 643--652."},{"issue":"1","key":"e_1_3_2_1_13_1","article-title":"The GraphBLAS C API","volume":"1","author":"Buluc Aydin","year":"2017","unstructured":"Aydin Buluc , Timothy Mattson , Scott McMillan , Jose Moreira , and Carl Yang . 2017 . The GraphBLAS C API Specification. Rev. 1 . 1 . Aydin Buluc, Timothy Mattson, Scott McMillan, Jose Moreira, and Carl Yang. 2017. The GraphBLAS C API Specification. Rev. 1.1.","journal-title":"Specification. Rev."},{"key":"e_1_3_2_1_14_1","volume-title":"The power of sparsity in convolutional neural networks. arXiv preprint:1702.06257","author":"Changpinyo Soravit","year":"2017","unstructured":"Soravit Changpinyo , Mark Sandler , and Andrey Zhmoginov . 2017. The power of sparsity in convolutional neural networks. arXiv preprint:1702.06257 ( 2017 ). Soravit Changpinyo, Mark Sandler, and Andrey Zhmoginov. 2017. The power of sparsity in convolutional neural networks. arXiv preprint:1702.06257 (2017)."},{"volume-title":"suitesparse: a suite of sparse matrix software","author":"Davis Tim","key":"e_1_3_2_1_15_1","unstructured":"Tim Davis . 2017. suitesparse: a suite of sparse matrix software . http:\/\/faculty.cse.tamu.edu\/davis\/suitesparse.html. (2017). Accessed: 2018-01-18. Tim Davis. 2017. suitesparse: a suite of sparse matrix software. http:\/\/faculty.cse.tamu.edu\/davis\/suitesparse.html. (2017). Accessed: 2018-01-18."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"volume-title":"High-Performance Graph Algorithms from Parallel Sparse Matrices","author":"Gilbert John","key":"e_1_3_2_1_17_1","unstructured":"John Gilbert , Steve Reinhardt , and Viral Shah . 2007. High-Performance Graph Algorithms from Parallel Sparse Matrices . Springer , 260--269. John Gilbert, Steve Reinhardt, and Viral Shah. 2007. High-Performance Graph Algorithms from Parallel Sparse Matrices. Springer, 260--269."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2003.12.008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. SIAM. Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. SIAM.","DOI":"10.1137\/1.9780898719918"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"volume-title":"The art of computer programming","author":"Knuth Donald E","key":"e_1_3_2_1_23_1","unstructured":"Donald E Knuth . 1997. The art of computer programming . Vol. 3 . Pearson Education . Donald E Knuth. 1997. The art of computer programming. Vol. 3. Pearson Education."},{"key":"e_1_3_2_1_24_1","first-page":"116","article-title":"Graphen und Matrizen (Graphs and matrices)","volume":"38","author":"Konig Denes","year":"1931","unstructured":"Denes Konig . 1931 . Graphen und Matrizen (Graphs and matrices) . Matematikai Lapok 38 (1931), 116 -- 119 . Denes Konig. 1931. Graphen und Matrizen (Graphs and matrices). Matematikai Lapok 38 (1931), 116--119.","journal-title":"Matematikai Lapok"},{"key":"e_1_3_2_1_25_1","unstructured":"Duane Merrill. 2015. CUB Library. http:\/\/nvlabs.github.io\/cub. (2015). Duane Merrill. 2015. CUB Library. http:\/\/nvlabs.github.io\/cub. (2015)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/3014904.3014982"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"e_1_3_2_1_28_1","volume-title":"The Network Data Repository with Interactive Graph Analytics and Visualization. In Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com","author":"Rossi Ryan","year":"2015","unstructured":"Ryan Rossi and Nesreen Ahmed . 2015 . The Network Data Repository with Interactive Graph Analytics and Visualization. In Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com Ryan Rossi and Nesreen Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442530"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.77"}],"event":{"name":"ICPP 2018: 47th International Conference on Parallel Processing","sponsor":["University of Oregon University of Oregon"],"location":"Eugene OR USA","acronym":"ICPP 2018"},"container-title":["Proceedings of the 47th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225058.3225122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T18:19:39Z","timestamp":1673979579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":31,"alternative-id":["10.1145\/3225058.3225122","10.1145\/3225058"],"URL":"https:\/\/doi.org\/10.1145\/3225058.3225122","relation":{},"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"2018-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}