{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:52:19Z","timestamp":1768992739184,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319273075","type":"print"},{"value":"9783319273082","type":"electronic"}],"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_43","type":"book-chapter","created":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T08:29:53Z","timestamp":1450340993000},"page":"528-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantifying the Performance Impact of Graph Structure on Neighbour Iteration Strategies for PageRank"],"prefix":"10.1007","author":[{"given":"Merijn","family":"Verstraaten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana Lucia","family":"Varbanescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cees","family":"de Laat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,18]]},"reference":[{"key":"43_CR1","unstructured":"Graph500. \n                      http:\/\/graph500.org"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine, A., Gregor, D., Hendrickson, B., Berry, J.W.: Challenges in parallel graph processing. Parallel Process. Lett. 17, 5\u201320 (2007)","journal-title":"Parallel Process. Lett."},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Burtscher, M., Nasre, R., Pingali, K.: A quantitative study of irregular programs on GPUs. In: 2012 IEEE International Symposium on Workload Characterization (IISWC), pp. 141\u2013151. IEEE (2012)","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/978-3-319-09873-9_61","volume-title":"Euro-Par 2014 Parallel Processing","author":"D Delling","year":"2014","unstructured":"Delling, D., Kobitzsch, M., Werneck, R.F.: Customizing driving directions with GPUs. In: Silva, F., Dutra, I., Santos Costa, V. (eds.) Euro-Par 2014 Parallel Processing. LNCS, vol. 8632, pp. 728\u2013739. Springer, Heidelberg (2014)"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Elser, B., Montresor, A.: An evaluation study of bigdata frameworks for graph processing. In: Big Data (2013)","DOI":"10.1109\/BigData.2013.6691555"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Gharaibeh, A., Costa, L.B., Santos-Neto, E., Ripeanu, M.: On graphs, GPUs, and blind dating: a workload to processor matchmaking quest. In: IPDPS, pp. 851\u2013862 (2013)","DOI":"10.1109\/IPDPS.2013.37"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Guo, Y., Biczak, M., Varbanescu, A.L., Iosup, A., Martella, C., Willke, T.L.: How Well do graph-processing platforms perform? an empirical performance evaluation and analysis. In: IPDPS (2014)","DOI":"10.1109\/IPDPS.2014.49"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Guo, Y., Varbanescu, A.L., Iosup, A., Epema, D.: An empirical performance evaluation of GPU-enabled graph-processing systems. In: CCGrid 2015 (2015)","DOI":"10.1109\/CCGrid.2015.20"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.14778\/2732977.2732980","volume":"7","author":"M Han","year":"2014","unstructured":"Han, M., Daudjee, K., Ammar, K., Ozsu, M.T., Wang, X., Jin, T.: An experimental comparison of pregel-like graph processing systems. Proc. VLDB Endowment 7, 1047\u20131058 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating CUDA graph algorithms at maximum warp. In: ACM SIGPLAN Notices. vol. 46, pp. 267\u2013276. ACM (2011)","DOI":"10.1145\/2038037.1941590"},{"key":"43_CR11","unstructured":"Leskovec, J.: Stanford Network Analysis Platform (SNAP). Stanford University (2006)"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.14778\/2735508.2735517","volume":"8","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Cheng, J., Yan, D., Wu, H.: Large-scale distributed graph computing systems: an experimental evaluation. Proc. VLDB Endowment 8, 281\u2013292 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Merrill, D., Garland, M., Grimshaw, A.S.: Scalable GPU graph traversal. In: PPOPP 2012, New Orleans, LA, USA. pp. 117\u2013128, February 2012","DOI":"10.1145\/2370036.2145832"},{"key":"43_CR14","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 on Parallel & Distributed Processing (IPDPS), pp. 463\u2013474. IEEE (2013)","DOI":"10.1109\/IPDPS.2013.28"},{"key":"43_CR15","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report 1999\u201366, Stanford InfoLab, previous number = SIDL-WP-1999-0120, November 1999. \n                      http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"43_CR16","unstructured":"Penders, A.: Accelerating graph analysis with heterogeneous systems. Master\u2019s thesis, PDS, EWI, TUDelft, December 2012"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Satish, N., Sundaram, N., Patwary, M.A., Seo, J., Park, J., Hassaan, M.A., Sengupta, S., Yin, Z., Dubey, P.: Navigating the maze of graph analytics frameworks using massive graph datasets. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2610518"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Varbanescu, A.L., Verstraaten, M., Penders, A., Sips, H., de Laat, C.: Can portability improve performance? an empirical study of parallel graph analytics. In: ICPE 2015 (2015)","DOI":"10.1145\/2668930.2688042"}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:41:34Z","timestamp":1587328894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27308-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319273075","9783319273082"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27308-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}]}}