{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T06:25:07Z","timestamp":1776925507785,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T00:00:00Z","timestamp":1518652800000},"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":[[2018,2,15]]},"DOI":"10.1145\/3174243.3174260","type":"proceedings-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T16:12:59Z","timestamp":1519402379000},"page":"239-248","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Accelerating Graph Analytics by Co-Optimizing Storage and Access on an FPGA-HMC Platform"],"prefix":"10.1145","author":[{"given":"Soroosh","family":"Khoram","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Jialiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Maxwell","family":"Strange","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Hogue","author":"Bader Gary D.","year":"2003","unstructured":"Gary D. Bader and Christopher W . Hogue . 2003 . An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 1 (13 Jan 2003), 2. Gary D. Bader and Christopher W. Hogue. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 1 (13 Jan 2003), 2."},{"key":"e_1_3_2_1_2_1","volume-title":"Storage and Analysis (SC), 2012 International Conference for. 1--10","author":"Beamer Scott","year":"2012","unstructured":"Scott Beamer , Krste Asanovic , and David Patterson . 2012 . Direction-optimizing Breadth-First Search. In High Performance Computing, Networking , Storage and Analysis (SC), 2012 International Conference for. 1--10 . Scott Beamer, Krste Asanovic, and David Patterson. 2012. Direction-optimizing Breadth-First Search. In High Performance Computing, Networking, Storage and Analysis (SC), 2012 International Conference for. 1--10."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.76.3251"},{"key":"e_1_3_2_1_4_1","volume-title":"Experiments on Graph Clustering Algorithms","author":"Brandes Ulrik","unstructured":"Ulrik Brandes , Marco Gaertler , and Dorothea Wagner . 2003. Experiments on Graph Clustering Algorithms . Springer Berlin Heidelberg , Berlin, Heidelberg , 568--579. Ulrik Brandes, Marco Gaertler, and Dorothea Wagner. 2003. Experiments on Graph Clustering Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg, 568--579."},{"key":"e_1_3_2_1_5_1","volume-title":"Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics 7, 1 (06","author":"Broh\u00e9e Sylvain","year":"2006","unstructured":"Sylvain Broh\u00e9e and Jacques van Helden . 2006. Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics 7, 1 (06 Nov 2006 ), 488. Sylvain Broh\u00e9e and Jacques van Helden. 2006. Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics 7, 1 (06 Nov 2006), 488."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847339"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.135"},{"key":"e_1_3_2_1_9_1","volume-title":"Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In 2010 Proceedings IEEE INFOCOM. 1--9.","author":"Gjoka M.","unstructured":"M. Gjoka , M. Kurant , C. T. Butts , and A. Markopoulou . 2010 . Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In 2010 Proceedings IEEE INFOCOM. 1--9. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. 2010. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In 2010 Proceedings IEEE INFOCOM. 1--9."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth351"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth919"},{"key":"e_1_3_2_1_13_1","volume-title":"Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","author":"Kyrola Aapo","unstructured":"Aapo Kyrola , Guy Blelloch , and Carlos Guestrin . 2012. GraphChi: Large-Scale Graph Computation on Just a PC . In Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12) . USENIX , Hollywood, CA , 31--46. https:\/\/www.usenix.org\/conference\/osdi12\/technical-sessions\/ presentation\/kyrola Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC. In Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12). USENIX, Hollywood, CA, 31--46. https:\/\/www.usenix.org\/conference\/osdi12\/technical-sessions\/ presentation\/kyrola"},{"key":"e_1_3_2_1_14_1","volume-title":"TorusBFS: A Novel Message-passing Parallel Breadth-First Search Architecture on FPGAs. Engineering Science and Technology, an International Journal 5, 5 (10","author":"Lei Guoqing","year":"2015","unstructured":"Guoqing Lei , Rongchun Li , Song Guo , and Fei Xia . 2015. TorusBFS: A Novel Message-passing Parallel Breadth-First Search Architecture on FPGAs. Engineering Science and Technology, an International Journal 5, 5 (10 2015 ), 313--318. Guoqing Lei, Rongchun Li, Song Guo, and Fei Xia. 2015. TorusBFS: A Novel Message-passing Parallel Breadth-First Search Architecture on FPGAs. Engineering Science and Technology, an International Journal 5, 5 (10 2015), 313--318."},{"key":"e_1_3_2_1_15_1","unstructured":"Kyle Locke. 2011. Parameterizable Content-Addressable Memory. https:\/\/www.xilinx.com\/support\/documentation\/application_notes\/xapp1151_ Param_CAM.pdf. (2011).  Kyle Locke. 2011. Parameterizable Content-Addressable Memory. https:\/\/www.xilinx.com\/support\/documentation\/application_notes\/xapp1151_ Param_CAM.pdf. (2011)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2011.7477494"},{"key":"e_1_3_2_1_18_1","unstructured":"Picocomputing. {n. d.}. Hybrid Memory Cube (HMC) and Controller IP. http: \/\/picocomputing.com\/hybrid-memory-cube-hmc-controller-ip\/. ({n. d.}).  Picocomputing. {n. d.}. Hybrid Memory Cube (HMC) and Controller IP. http: \/\/picocomputing.com\/hybrid-memory-cube-hmc-controller-ip\/. ({n. d.})."},{"key":"e_1_3_2_1_19_1","unstructured":"Picocomputing. {n. d.}. UltraScale-based SuperProcessor with Hybrid Memory Cube. http:\/\/picocomputing.com\/ac-510-superprocessor-module. ({n. d.}).  Picocomputing. {n. d.}. UltraScale-based SuperProcessor with Hybrid Memory Cube. http:\/\/picocomputing.com\/ac-510-superprocessor-module. ({n. d.})."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2015.7293939"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688538"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021737"}],"event":{"name":"FPGA '18: The 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","location":"Monterey CALIFORNIA USA","acronym":"FPGA '18","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174243.3174260","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3174243.3174260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:33Z","timestamp":1750212693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174243.3174260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,15]]},"references-count":22,"alternative-id":["10.1145\/3174243.3174260","10.1145\/3174243"],"URL":"https:\/\/doi.org\/10.1145\/3174243.3174260","relation":{},"subject":[],"published":{"date-parts":[[2018,2,15]]},"assertion":[{"value":"2018-02-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}