{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:21Z","timestamp":1772791521509,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1850274"],"award-info":[{"award-number":["1850274"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007065","name":"Nvidia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007065","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3307681.3326606","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"121-131","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["XBFS"],"prefix":"10.1145","author":[{"given":"Anil","family":"Gaihre","sequence":"first","affiliation":[{"name":"University of Massachusetts Lowell, Lowell, MA, USA"}]},{"given":"Zhenlin","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Massachusetts Lowell, Lowell, MA, USA"}]},{"given":"Fan","family":"Yao","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}]},{"given":"Hang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Massachusetts Lowell, Lowell, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00061"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.52"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882959"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00017"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547570"},{"key":"e_1_3_2_1_6_1","volume-title":"SIGMOD","author":"Bhattarai Bibek","year":"2019"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Sabu M Thampi etal Survey of search and replication schemes in unstructured p2p networks. arXiv preprint arXiv:1008.1629 2010.  Sabu M Thampi et al. Survey of search and replication schemes in unstructured p2p networks. arXiv preprint arXiv:1008.1629 2010.","DOI":"10.5296\/npa.v2i1.263"},{"key":"e_1_3_2_1_8_1","unstructured":"Graph500. http:\/\/www.graph500.org\/.  Graph500. http:\/\/www.graph500.org\/."},{"key":"e_1_3_2_1_9_1","unstructured":"Inside Volta. The world's most advanced data center gpu. https:\/\/devblogs. nvidia. com\/parallelforall\/inside-volta 2017.  Inside Volta. The world's most advanced data center gpu. https:\/\/devblogs. nvidia. com\/parallelforall\/inside-volta 2017."},{"key":"e_1_3_2_1_10_1","unstructured":"Nvidia. Nvidia tesla p100 architecture whitepaper. 2016.  Nvidia. Nvidia tesla p100 architecture whitepaper. 2016."},{"key":"e_1_3_2_1_11_1","volume-title":"OSDI","author":"Zhu Xiaowei","year":"2016"},{"key":"e_1_3_2_1_12_1","volume-title":"USENIX FAST","author":"Hang","year":"2017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_14_1","volume-title":"SC","author":"Hang Liu","year":"2015"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.34"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018756"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837289"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.101"},{"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.1145\/2600212.2600227"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.15"},{"key":"e_1_3_2_1_24_1","volume-title":"ASPLOS","author":"Nodehi Sabet Amir Hossein","year":"2018"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.41"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935766"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684237"},{"key":"e_1_3_2_1_30_1","unstructured":"Hang Liu et al. Simd-x: Programming and processing of graph algorithms on gpus. arXiv preprint arXiv:1812.04070 2018.  Hang Liu et al. Simd-x: Programming and processing of graph algorithms on gpus. arXiv preprint arXiv:1812.04070 2018."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_32_1","unstructured":"Amazon. Price of Quadro P6000. Retrived from https:\/\/www.amazon.com\/PNY-Quadro-P6000-Graphic-Card\/dp\/B01M0S2FKR?keywords=Quadro  Amazon. Price of Quadro P6000. Retrived from https:\/\/www.amazon.com\/PNY-Quadro-P6000-Graphic-Card\/dp\/B01M0S2FKR?keywords=Quadro"},{"key":"e_1_3_2_1_33_1","unstructured":"P6000&qid=1539599742&s=Electronics&sr=1--2&ref=sr_1_2. Accessed: 2018 October 6.  P6000&qid=1539599742&s=Electronics&sr=1--2&ref=sr_1_2. Accessed: 2018 October 6."},{"key":"e_1_3_2_1_34_1","unstructured":"Intel. Price of Intel Xeon Platinum 8158 Processor. Retrived from https:\/\/ark.intel.com\/products\/120500\/Intel-Xeon-Platinum-8158-Processor-24--75M-Cache-3-00-GHz-. Accessed: 2018 October 6.  Intel. Price of Intel Xeon Platinum 8158 Processor. Retrived from https:\/\/ark.intel.com\/products\/120500\/Intel-Xeon-Platinum-8158-Processor-24--75M-Cache-3-00-GHz-. Accessed: 2018 October 6."},{"key":"e_1_3_2_1_35_1","unstructured":"Mark Harris. Parallel prefix sum (scan) with cuda.  Mark Harris. Parallel prefix sum (scan) with cuda."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Scott Beamer etal Direction-optimizing breadth-first search. SC 2013.   Scott Beamer et al. Direction-optimizing breadth-first search. SC 2013.","DOI":"10.1109\/SC.2012.50"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jack J Dongarra etal LINPACK users' guide volume 8. Siam 1979.  Jack J Dongarra et al. LINPACK users' guide volume 8. Siam 1979.","DOI":"10.1137\/1.9781611971811"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Edward Anderson etal LAPACK Users' guide. 1999.   Edward Anderson et al. LAPACK Users' guide. 1999.","DOI":"10.1137\/1.9780898719604"},{"key":"e_1_3_2_1_39_1","unstructured":"Wikipedia. Graphics Processing Units. Retrived from https:\/\/en.wikipedia.org\/wiki\/Graphics_processing_unit. Accessed: 2018\/10\/6.  Wikipedia. Graphics Processing Units. Retrived from https:\/\/en.wikipedia.org\/wiki\/Graphics_processing_unit. Accessed: 2018\/10\/6."},{"key":"e_1_3_2_1_40_1","unstructured":"The Koblez Network Collection. http:\/\/konect.uni-koblenz.de\/networks\/.  The Koblez Network Collection. http:\/\/konect.uni-koblenz.de\/networks\/."},{"key":"e_1_3_2_1_41_1","unstructured":"SNAP\n\n  \n  : Stanford Large Network Dataset. http:\/\/snap.stanford.edu\/data\/.  SNAP: Stanford Large Network Dataset. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_1_42_1","unstructured":"Matthias Springer. Breadth-first Search in CUDA. Retrived from https:\/\/m-sp.org\/downloads\/titech_bfs_cuda.pdf. Accessed: 2019 April 4.  Matthias Springer. Breadth-first Search in CUDA. Retrived from https:\/\/m-sp.org\/downloads\/titech_bfs_cuda.pdf. Accessed: 2019 April 4."},{"key":"e_1_3_2_1_43_1","unstructured":"Shubhabrata Sengupta etal Scan primitives for gpu computing. 2007.   Shubhabrata Sengupta et al. Scan primitives for gpu computing. 2007."},{"key":"e_1_3_2_1_44_1","unstructured":"Yuan Lin et al. Using CUDA Warp-Level Primitives. Retrived from https:\/\/devblogs.nvidia.com\/using-cuda-warp-level-primitives\/. Accessed: 2019 April 3.  Yuan Lin et al. Using CUDA Warp-Level Primitives. Retrived from https:\/\/devblogs.nvidia.com\/using-cuda-warp-level-primitives\/. Accessed: 2019 April 3."},{"key":"e_1_3_2_1_45_1","unstructured":"Nvidia cuda c programming guide. NVIDIA Corporation 2018.  Nvidia cuda c programming guide. NVIDIA Corporation 2018."}],"event":{"name":"HPDC '19: The 28th International Symposium on High-Performance Parallel and Distributed Computing","location":"Phoenix AZ USA","acronym":"HPDC '19","sponsor":["University of Arizona University of Arizona","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3307681.3326606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3307681.3326606","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3307681.3326606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:06Z","timestamp":1750204446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3307681.3326606"}},"subtitle":["eXploring Runtime Optimizations for Breadth-First Search on GPUs"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":45,"alternative-id":["10.1145\/3307681.3326606","10.1145\/3307681"],"URL":"https:\/\/doi.org\/10.1145\/3307681.3326606","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}