{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:41:24Z","timestamp":1729658484210,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/bigdata.2013.6691600","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T19:11:49Z","timestamp":1388776309000},"page":"394-402","source":"Crossref","is-referenced-by-count":31,"title":["NUMA-optimized parallel breadth-first search on multicore single-node system"],"prefix":"10.1109","author":[{"given":"Yuichiro","family":"Yasui","sequence":"first","affiliation":[]},{"given":"Katsuki","family":"Fujisawa","sequence":"additional","affiliation":[]},{"given":"Kazushige","family":"Goto","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2287076.2287104"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1145\/2063384.2063471","article-title":"Parallel breadth-first search on distributed memory systems","author":"buluc?","year":"2011","journal-title":"Proc ACM\/IEEE Int Conf High Performance Computing Networking Storage and Analysis (SC11)"},{"key":"12","article-title":"Breaking the speed and scalability barriers for graph exploration on distributed-memory machines","author":"petrini","year":"2012","journal-title":"Proc ACM\/IEEE Int Conf High Performance Computing Networking Storage and Analysis (SC12)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.67"},{"key":"2","first-page":"259","article-title":"NETAL: High-performance implementation of network analysis library considering computer memory hierarchy","volume":"54","author":"yasui","year":"2011","journal-title":"J Oper Res Soc Japan"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"10","first-page":"25","article-title":"A scalable distributed parallel breadth-first search algorithm on bluegene\/l","author":"yoo","year":"2005","journal-title":"Proc of the ACM\/IEEE Conf on Supercomputing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"4","first-page":"985","article-title":"Kronecker graphs: An approach to modeling networks","volume":"11","author":"leskovec","year":"2010","journal-title":"J Mach Learning Res"},{"key":"9","article-title":"Directionoptimizing breadth-first search","author":"beamer","year":"2012","journal-title":"Proc ACM\/IEEE Int Conf High Performance Computing Networking Storage and Analysis (SC12)"},{"journal-title":"Searching for A Parent Instead of Fighting over Children A Fast Breadth-First Search Implementation for Graph500","year":"2011","author":"beamer","key":"8"}],"event":{"name":"2013 IEEE International Conference on Big Data","start":{"date-parts":[[2013,10,6]]},"location":"Silicon Valley, CA, USA","end":{"date-parts":[[2013,10,9]]}},"container-title":["2013 IEEE International Conference on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6679357\/6690588\/06691600.pdf?arnumber=6691600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T05:15:11Z","timestamp":1498108511000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6691600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2013.6691600","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}