{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:04:19Z","timestamp":1768028659743,"version":"3.49.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/iiswc.2011.6114175","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T14:29:46Z","timestamp":1325860186000},"page":"149-158","source":"Crossref","is-referenced-by-count":51,"title":["Performance characteristics of Graph500 on large-scale distributed environment"],"prefix":"10.1109","author":[{"given":"Toyotaro","family":"Suzumura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Ueno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hitoshi","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuki","family":"Fujisawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Matsuoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","year":"0","journal-title":"MVAPICH2"},{"key":"18","year":"0"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470353"},{"key":"16","article-title":"Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication","author":"leskovec","year":"2005","journal-title":"Proc European Conf Principles and Practice of Knowledge Discovery in Databases"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70811"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094844"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"1","year":"0"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77220-0_21"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.55"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"5","author":"bader","year":"2007","journal-title":"HPCS Scalable Synthetic Compact Applications #2 Graph Analysis (SSCA#2 V2 2 Specification)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2006.302741"},{"key":"8","article-title":"Parallel shortest path algorithms for solving large-scale instances","author":"madduri","year":"2006","journal-title":"9th DIMACS Implementation Challenge - The Shortest Path Problem"}],"event":{"name":"2011 IEEE International Symposium on Workload Characterization (IISWC)","location":"Austin, TX, USA","start":{"date-parts":[[2011,11,6]]},"end":{"date-parts":[[2011,11,8]]}},"container-title":["2011 IEEE International Symposium on Workload Characterization (IISWC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6107922\/6114172\/06114175.pdf?arnumber=6114175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T13:16:21Z","timestamp":1490102181000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6114175\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iiswc.2011.6114175","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}