{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:46:14Z","timestamp":1725871574347},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319495828"},{"type":"electronic","value":"9783319495835"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49583-5_52","type":"book-chapter","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T03:11:09Z","timestamp":1479957069000},"page":"675-683","source":"Crossref","is-referenced-by-count":2,"title":["Synthetic Traffic Model of the Graph500 Communications"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Fuentes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Vallejo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luis","family":"Bosque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"Beivide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreea","family":"Anghel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitch","family":"Gusat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyriel","family":"Minkenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,25]]},"reference":[{"key":"52_CR1","unstructured":"Graph500 benchmark, May 2016. http:\/\/www.graph500.org\/"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Anghel, A., Rodriguez, G., Prisacari, B.: The importance and characteristics of communication in high performance data analytics. In: 2014 IEEE International Symposium on Workload Characterization (IISWC), pp. 80\u201381. IEEE (2014)","DOI":"10.1109\/IISWC.2014.6983044"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovic, K., Patterson, D.: Locality exists in graph processing: workload characterization on an Ivy bridge server. In: 2015 IEEE International Symposium on Workload Characterization (IISWC), pp. 56\u201365, October 2015","DOI":"10.1109\/IISWC.2015.12"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: Proceedings of 2004 SIAM International Conference on Data Mining, pp. 442\u2013446 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"52_CR5","volume-title":"Statistical Models in S","author":"J Chambers","year":"1992","unstructured":"Chambers, J., Hastie, T.: Statistical Models in S. Wadsworth & Brooks\/Cole, Pacific Grove (1992)"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Fuentes, P., Bosque, J.L., Beivide, R., Valero, M., Minkenberg, C.: Characterizing the communication demands of the Graph500 benchmark on a commodity cluster. In: Proceedings of 2014 IEEE\/ACM International Symposium on Big Data Computing, pp. 83\u201389 (2014)","DOI":"10.1109\/BDC.2014.16"},{"issue":"3","key":"52_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.20417","volume":"58","author":"C Gro\u00ebr","year":"2011","unstructured":"Gro\u00ebr, C., Sullivan, B.D., Poole, S.: A mathematical analysis of the r-mat random graph generator. Networks 58(3), 159\u2013170 (2011)","journal-title":"Networks"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-18009-5_7","volume-title":"Algorithms and Models for the Web-Graph","author":"M Kim","year":"2010","unstructured":"Kim, M., Leskovec, J.: Multiplicative attribute graph model of real-world networks. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol. 6516, pp. 62\u201373. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-18009-5_7"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: An in-depth study of Stochastic Kronecker graphs. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 587\u2013596. IEEE (2011)","DOI":"10.1109\/ICDM.2011.23"},{"key":"52_CR10","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: 2011 IEEE International Symposium on Workload characterization (IISWC), pp. 149\u2013158. IEEE (2011)","DOI":"10.1109\/IISWC.2011.6114175"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49583-5_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T00:23:03Z","timestamp":1498350183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49583-5_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319495828","9783319495835"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49583-5_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}