{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:43:11Z","timestamp":1770903791980,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"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.3174245","type":"proceedings-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T16:12:59Z","timestamp":1519402379000},"page":"229-238","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Degree-aware Hybrid Graph Traversal on FPGA-HMC Platform"],"prefix":"10.1145","author":[{"given":"Jialiang","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, University of Wisconsin-Madiso, WI, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Emergence of scaling in random networks. science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. science 286, 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_1_2_1","unstructured":"Scott Beamer Krste Asanovic and David A Patterson. 2011. Searching for a parent instead of fighting over children: A fast breadth-first search implementation for graph500. (2011).  Scott Beamer Krste Asanovic and David A Patterson. 2011. Searching for a parent instead of fighting over children: A fast breadth-first search implementation for graph500. (2011)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.159"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1009"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"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\/3020078.3021739"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053907"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_3_2_1_12_1","unstructured":"Aapo Kyrola Guy Blelloch and Carlos Guestrin. 2012. GraphChi: large-scale graph computation on just a PC. In USENIX OSDI.   Aapo Kyrola Guy Blelloch and Carlos Guestrin. 2012. GraphChi: large-scale graph computation on just a PC. In USENIX OSDI."},{"key":"e_1_3_2_1_13_1","unstructured":"Guoqing LEI Rongchun LI Song GUO and Fei XIA. 2016. TorusBFS: A Novel Message-passing Parallel Breadth-First Search Architecture on FPGAs. (10 2016).  Guoqing LEI Rongchun LI Song GUO and Fei XIA. 2016. TorusBFS: A Novel Message-passing Parallel Breadth-First Search Architecture on FPGAs. (10 2016)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807594"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2013.9"},{"key":"e_1_3_2_1_16_1","unstructured":"Richard C Murphy Kyle B Wheeler Brian W Barrett and James A Ang. 2010. Introducing the graph 500. (2010).  Richard C Murphy Kyle B Wheeler Brian W Barrett and James A Ang. 2010. Introducing the graph 500. (2010)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICANMEET.2013.6609386"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/.13"},{"key":"e_1_3_2_1_19_1","volume-title":"Hybrid memory cube (HMC)","author":"Pawlowski J Thomas","unstructured":"J Thomas Pawlowski . 2011. Hybrid memory cube (HMC) . In IEEE Hot Chips . J Thomas Pawlowski. 2011. Hybrid memory cube (HMC). In IEEE Hot Chips."},{"key":"e_1_3_2_1_20_1","unstructured":"Picocomputing. 2016. UltraScale-based SuperProcessor with Hybrid Memory Cube. http:\/\/picocomputing.com\/ac-510-superprocessor-module. (2016).  Picocomputing. 2016. UltraScale-based SuperProcessor with Hybrid Memory Cube. http:\/\/picocomputing.com\/ac-510-superprocessor-module. (2016)."},{"key":"e_1_3_2_1_21_1","volume-title":"Social network analysis","author":"Scott John","unstructured":"John Scott . 2017. Social network analysis . Sage . John Scott. 2017. Social network analysis. Sage."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"},{"key":"e_1_3_2_1_23_1","unstructured":"Xilinx. 2011. Ultrascale Plus Fpga Product Selection Guide. https:\/\/www.xilinx.com\/support\/documentation\/selection-guides\/ultrascaleplus-fpga-product-selection-guide.pdf. (2011).  Xilinx. 2011. Ultrascale Plus Fpga Product Selection Guide. https:\/\/www.xilinx.com\/support\/documentation\/selection-guides\/ultrascaleplus-fpga-product-selection-guide.pdf. (2011)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2915516.2915522"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021737"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2016.35"}],"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.3174245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3174243.3174245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:55Z","timestamp":1750208935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174243.3174245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,15]]},"references-count":26,"alternative-id":["10.1145\/3174243.3174245","10.1145\/3174243"],"URL":"https:\/\/doi.org\/10.1145\/3174243.3174245","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"}}]}}