{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:59:58Z","timestamp":1725843598106},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319273075"},{"type":"electronic","value":"9783319273082"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27308-2_20","type":"book-chapter","created":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T13:29:53Z","timestamp":1450358993000},"page":"233-245","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Accelerating Direction-Optimized Breadth First Search on Hybrid Architectures"],"prefix":"10.1007","author":[{"given":"Scott","family":"Sallinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdullah","family":"Gharaibeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matei","family":"Ripeanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,18]]},"reference":[{"key":"20_CR1","unstructured":"Beamer, S., Patterson, D.A.: Searching for a parent instead of fighting over children: A fast breadth-first search implementation for graph500 (2011)"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1038\/nrn2575","volume":"10","author":"E Bullmore","year":"2009","unstructured":"Bullmore, E., Sporns, O.: Complex brain networks: graph theoretical analysis of structural and functional systems. Nat. Rev. Neurosci. 10(3), 186\u2013198 (2009)","journal-title":"Nat. Rev. Neurosci."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Cha, M., Haddadi, H., Benevenuto, F., Gummadi, P.K.: Measuring user influence in twitter: The million follower fallacy. (2010)","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Cumming, B., Fourestey, G., Fuhrer, O., Gysi, T.: Application centric energy-efficiency study of distributed multi-core and hybrid cpu-gpu systems. In: SC (2014)","DOI":"10.1109\/SC.2014.72"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Gharaibeh, A., Reza, T., Santos-Neto, E., Sallinen, S., Ripeanu, M.: Efficient large-scale graph processing on hybrid cpu and gpu systems. arXiv:1312 (2014)","DOI":"10.1145\/2535753.2535755"},{"key":"20_CR6","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI (2012)"},{"key":"20_CR7","unstructured":"Graph500. http:\/\/www.graph500.org\/"},{"key":"20_CR8","unstructured":"Green Graph500. http:\/\/green.graph500.org\/"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating cuda graph algorithms at maximum warp (2011)","DOI":"10.1145\/1941553.1941590"},{"issue":"6833","key":"20_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barab\u00e1si, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41\u201342 (2001)","journal-title":"Nature"},{"key":"20_CR11","unstructured":"Kunegis, J.: The koblenz network collection. In: World Wide Web Companion (2013)"},{"key":"20_CR12","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"20_CR13","unstructured":"Low, Y., Gonzalez, J.E., Kyrola, A., Bickson, D., Guestrin, C.E., Hellerstein, J.: Graphlab: a new framework for parallel machine learning (2014). arXiv:1408.2041"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Merrill, D., Garland, M., Grimshaw, A.: Scalable gpu graph traversal. In: ACM SIGPLAN Notices, vol. 47, pp. 117\u2013128. ACM (2012)","DOI":"10.1145\/2370036.2145832"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: SOSP (2013)","DOI":"10.1145\/2517349.2522739"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Pearce, R., Gokhale, M., Amato, N.M.: Scaling techniques for massive scale-free graphs in distributed (external) memory. In: IPDPS (2013)","DOI":"10.1109\/IPDPS.2013.72"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Pearce, R., Gokhale, M., Amato, N.M.: Faster parallel traversal of scale free graphs at extreme scale with vertex delegates. In: SC (2014)","DOI":"10.1109\/SC.2014.50"},{"key":"20_CR18","unstructured":"Sallinen, S., Borges, D., Gharaibeh, A., Ripeanu, M.: Exploring hybrid hardware and data placement strategies for the graph 500 challenge (2014)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: ACM SIGPLAN Notices, vol. 48, pp. 135\u2013146. ACM (2013)","DOI":"10.1145\/2517327.2442530"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MCAS.2003.1228503","volume":"3","author":"XF Wang","year":"2003","unstructured":"Wang, X.F., Chen, G.: Complex networks: small-world, scale-free and beyond. IEEE Circuits Syst. Mag. 3(1), 6\u201320 (2003)","journal-title":"IEEE Circuits Syst. Mag."},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-319-07518-1_23","volume-title":"Supercomputing","author":"Y Yasui","year":"2014","unstructured":"Yasui, Y., Fujisawa, K., Sato, Y.: Fast and energy-efficient breadth-first search on a single NUMA system. In: Kunkel, J.M., Ludwig, T., Meuer, H.W. (eds.) ISC 2014. LNCS, vol. 8488, pp. 365\u2013381. Springer, Heidelberg (2014)"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"You, Y., Bader, D., Dehnavi, M.M.: Designing a heuristic cross-architecture combination for breadth-first search. In: ICPP (2014)","DOI":"10.1109\/ICPP.2014.16"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2015: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27308-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T05:43:17Z","timestamp":1692164597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27308-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319273075","9783319273082"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27308-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}