{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:01:48Z","timestamp":1726408908022},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080093"},{"type":"electronic","value":"9783319080109"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08010-9_46","type":"book-chapter","created":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T18:17:50Z","timestamp":1403115470000},"page":"435-447","source":"Crossref","is-referenced-by-count":1,"title":["Load-Balanced Breadth-First Search on GPUs"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Jianjun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"10th dimacs implementation challenge, \n                      \n                        http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml"},{"key":"46_CR2","unstructured":"The graph 500 list, \n                      \n                        http:\/\/www.graph500.org\/"},{"key":"46_CR3","unstructured":"Nvidia cuda, \n                      \n                        http:\/\/www.nvidia.com\/cuda\/"},{"key":"46_CR4","unstructured":"University of florida sparse matrix collection, \n                      \n                        http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/"},{"key":"46_CR5","unstructured":"Bader, D.A., Madduri, K.: Gtgraph: A synthetic graph generator suite, Atlanta, GA (February 2006)"},{"issue":"1","key":"46_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0255(91)90028-S","volume":"56","author":"N. Deo","year":"1991","unstructured":"Deo, N., Sarkar, D.: Parallel algorithms for merging and sorting. Information Sciences\u00a056(1), 151\u2013161 (1991)","journal-title":"Information Sciences"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-77220-0_21","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"P. Harish","year":"2007","unstructured":"Harish, P., Narayanan, P.J.: Accelerating large graph algorithms on the GPU using CUDA. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol.\u00a04873, pp. 197\u2013208. Springer, Heidelberg (2007)"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating cuda graph algorithms at maximum warp. In: Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, pp. 267\u2013276. ACM (2011)","DOI":"10.1145\/1941553.1941590"},{"key":"46_CR9","unstructured":"Leiserson, C.E., Rivest, R.L., Stein, C., Cormen, T.H.: Introduction to algorithms. The MIT Press (2009)"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Luo, L., Wong, M., Hwu, W.M.: An effective gpu implementation of breadth-first search. In: Proceedings of the 47th Design Automation Conference, pp. 52\u201355. ACM (2010)","DOI":"10.1145\/1837274.1837289"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Merrill, D., Garland, M., Grimshaw, A.: Scalable gpu graph traversal. In: ACM SIGPLAN Notices, vol.\u00a017, pp. 117\u2013128. ACM (2012)","DOI":"10.1145\/2145816.2145832"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Nasre, R., Burtscher, M., Pingali, K.: Data-driven versus topology-driven irregular computations on gpus. In: 2013 IEEE 27th International Symposium onParallel & Distributed Processing (IPDPS), pp. 463\u2013474. IEEE (2013)","DOI":"10.1109\/IPDPS.2013.28"},{"key":"46_CR13","unstructured":"Nguyen, H.: Gpu gems 3. Addison-Wesley Professional (2007)"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Odeh, S., Green, O., Mwassi, Z., Shmueli, O., Birk, Y.: Merge path-parallel merging made simple. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), pp. 1611\u20131618. IEEE (2012)","DOI":"10.1109\/IPDPSW.2012.202"},{"issue":"1","key":"46_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Vishkin, U.: Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms\u00a02(1), 88\u2013102 (1981)","journal-title":"Journal of Algorithms"},{"key":"46_CR16","unstructured":"Zhong, J., He, B.: Medusa: Simplified graph processing on gpus. IEEE Transactions on Parallel and Distributed Systems 99, 1 (2013) (PrePrints)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08010-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:09:50Z","timestamp":1558912190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08010-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080093","9783319080109"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08010-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}