{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:59Z","timestamp":1773481859451,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319201184","type":"print"},{"value":"9783319201191","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":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20119-1_33","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:36:48Z","timestamp":1434710208000},"page":"472-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantifying Communication in Graph Analytics"],"prefix":"10.1007","author":[{"given":"Andreea","family":"Anghel","sequence":"first","affiliation":[]},{"given":"German","family":"Rodriguez","sequence":"additional","affiliation":[]},{"given":"Bogdan","family":"Prisacari","sequence":"additional","affiliation":[]},{"given":"Cyriel","family":"Minkenberg","sequence":"additional","affiliation":[]},{"given":"Gero","family":"Dittmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"33_CR1","unstructured":"Apache Giraph. http:\/\/giraph.apache.org\/"},{"key":"33_CR2","unstructured":"Barcelona Supercomputing Center (BSC) Marenostrum supercomputer. http:\/\/www.bsc.es\/marenostrum-support-services\/mn3"},{"key":"33_CR3","unstructured":"Extrae instrumentation package. http:\/\/www.bsc.es\/computer-sciences\/extrae"},{"key":"33_CR4","unstructured":"Graph 500 benchmark. http:\/\/www.graph500.org\/"},{"key":"33_CR5","unstructured":"SPEC MPI2007. https:\/\/www.spec.org\/mpi\/"},{"key":"33_CR6","unstructured":"Top 500 list, November 2014. http:\/\/www.top500.org\/list\/2014\/11\/. Accessed 10 February 2015"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Agarwal, V., Petrini, F., Pasetto, D., Bader, D.A.: Scalable graph exploration on multicore processors. In: Proceedings of the 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2010, pp. 1\u201311. IEEE Computer Society, Washington, DC (2010). http:\/\/dx.doi.org\/10.1109\/SC.2010.46","DOI":"10.1109\/SC.2010.46"},{"key":"33_CR8","unstructured":"Bader, D., Riedy, J., Meyerhenke, H.: Applications and challenges in large-scale graph analysis. In: HPC Graph Analytics Workshop (2013)"},{"key":"33_CR9","unstructured":"Badia, R.M., Labarta, J., Gimenez, J., Escale, F.: DIMEMAS: predicting MPI applications behavior in grid environments. In: Workshop on Grid Applications and Programming Tools (GGF8), vol. 86, pp. 52\u201362 (2003)"},{"issue":"5","key":"33_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1941487.1941507","volume":"54","author":"S Borkar","year":"2011","unstructured":"Borkar, S., Chien, A.: The future of microprocessors. Commun. ACM 54(5), 67\u201377 (2011)","journal-title":"Commun. ACM"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"1\/2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1147\/JRD.2012.2232414","volume":"57","author":"F Checconi","year":"2013","unstructured":"Checconi, F., Petrini, F.: Massive data analytics: the graph 500 on IBM blue gene\/Q. IBM J. Res. Dev. 57(1\/2), 10 (2013)","journal-title":"IBM J. Res. Dev."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Chung, I.H., Walkup, R.E., Wen, H.F., Yu, H.: MPI performance analysis tools on blue gene\/L. In: Proceedings of the 2006 ACM\/IEEE Conference on Supercomputing, SC 2006. ACM, New York (2006). http:\/\/doi.acm.org\/10.1145\/1188455.1188583","DOI":"10.1109\/SC.2006.43"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Crovella, M.E., LeBlanc, T.J.: Parallel performance prediction using lost cycles analysis. In: Proceedings of the 1994 ACM\/IEEE Conference on Supercomputing, Supercomputing 1994, pp. 600\u2013609. IEEE Computer Society Press, Los Alamitos (1994)","DOI":"10.1145\/602770.602870"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Dally, B.: Power, programmability, and granularity: the challenges of exascale computing. In: IEEE Parallel & Distributed Processing Symposium, pp. 878\u2013878 (2011)","DOI":"10.1109\/IPDPS.2011.420"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-38750-0_9","volume-title":"Supercomputing","author":"J Jose","year":"2013","unstructured":"Jose, J., Potluri, S., Tomko, K., Panda, D.K.: Designing scalable graph500 benchmark with hybrid MPI+OpenSHMEM programming models. In: Kunkel, J.M., Ludwig, T., Meuer, H.W. (eds.) ISC 2013. LNCS, vol. 7905, pp. 109\u2013124. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-38750-0_9"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-68564-7_9","volume-title":"Tools for High Performance Computing","author":"A Knpfer","year":"2008","unstructured":"Knpfer, A., et al.: The vampir performance analysis tool-set. In: Resch, M., Keller, R., Himmler, V., Krammer, B., Schulz, A. (eds.) Tools for High Performance Computing, pp. 139\u2013155. Springer, Heidelberg (2008). http:\/\/dx.doi.org\/10.1007\/978-3-540-68564-7_9"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/BFb0024763","volume-title":"Euro-Par\u201996 - Parallel Processing","author":"J Labarta","year":"1996","unstructured":"Labarta, J., Girona, S., Pillet, V., Cortes, T., Gregoris, L.: DiP: a parallel program. In: Fraigniaud, P., Mignotte, A., Robert, Y., Boug\u00e9, L. (eds.) Euro-Par 1996. LNCS, vol. 1124, pp. 665\u2013674. Springer, London (1996)"},{"issue":"8","key":"33_CR19","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716\u2013727 (2012). http:\/\/dx.doi.org\/10.14778\/2212351.2212354","journal-title":"Proc. VLDB Endow."},{"key":"33_CR20","unstructured":"Murphy, R.C., Wheeler, K., Barrett, B., Ang, J.: Introducing the Graph 500. Cray Users Group (CUG) (2010)"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Satish, N., Kim, C., Chhugani, J., Dubey, P.: Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, pp. 14:1\u201314:11 (2012)","DOI":"10.1109\/SC.2012.70"},{"issue":"2","key":"33_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1177\/1094342006064482","volume":"20","author":"SS Shende","year":"2006","unstructured":"Shende, S.S., Malony, A.D.: The Tau parallel performance system. Int. J. High Perform. Comput. Appl. 20(2), 287\u2013311 (2006). http:\/\/dx.doi.org\/10.1177\/1094342006064482","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Suzumura, T., Ueno, K., Sato, H., Fujisawa, K., Matsuoka, S.: Performance characteristics of Graph500 on large-scale distributed environment. In: Proceedings of the 2011 IEEE International Symposium on Workload Characterization, IISWC 2011, pp. 149\u2013158 (2011)","DOI":"10.1109\/IISWC.2011.6114175"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Ueno, K., Suzumura, T.: 2D partitioning based graph search for the Graph500 benchmark. In: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, IPDPSW 2012, pp. 1925\u20131931 (2012)","DOI":"10.1109\/IPDPSW.2012.240"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Ueno, K., Suzumura, T.: Highly scalable graph search for the graph500 benchmark. In: Proceedings of the 21st International Symposium on High-Performance Parallel and Distributed Computing, HPDC 2012, pp. 149\u2013160. ACM, New York (2012). http:\/\/doi.acm.org\/10.1145\/2287076.2287104","DOI":"10.1145\/2287076.2287104"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20119-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:42:40Z","timestamp":1676943760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20119-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319201184","9783319201191"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20119-1_33","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":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}