{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T23:09:22Z","timestamp":1769123362038,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T00:00:00Z","timestamp":1483920000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"JST CREST"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s41019-016-0024-y","type":"journal-article","created":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T03:18:46Z","timestamp":1483931926000},"page":"22-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines"],"prefix":"10.1007","volume":"2","author":[{"given":"Koji","family":"Ueno","sequence":"first","affiliation":[]},{"given":"Toyotaro","family":"Suzumura","sequence":"additional","affiliation":[]},{"given":"Naoya","family":"Maruyama","sequence":"additional","affiliation":[]},{"given":"Katsuki","family":"Fujisawa","sequence":"additional","affiliation":[]},{"given":"Satoshi","family":"Matsuoka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,9]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","unstructured":"Ajima Y, Takagi Y, Inoue T, Hiramoto S, Shimizu T (2011) The tofu interconnect. In: 2011 IEEE 19th Annual Symposium on High Performance Interconnects, pp 87\u201394. doi: 10.1109\/HOTI.2011.21","DOI":"10.1109\/HOTI.2011.21"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Beamer S, Asanovi\u0107 K, Patterson D (2012) Direction-optimizing breadth-first search. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC \u201912, pp 12:1\u201312:10. IEEE Computer Society Press, Los Alamitos, CA, USA. http:\/\/dl.acm.org\/citation.cfm?id=2388996.2389013","DOI":"10.1109\/SC.2012.50"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Beamer S, Buluc A, Asanovic K, Patterson D (2013) Distributed-memory breadth-first search revisited: Enabling bottom-up search. In: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, IPDPSW \u201913, pp 1618\u20131627. IEEE Computer Society, Washington, DC, USA. doi: 10.1109\/IPDPSW.2013.159","DOI":"10.1109\/IPDPSW.2013.159"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Buluc A, Gilbert JR (2008) On the representation and multiplication of hypersparse matrices. In: IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008, pp 1\u201311. doi: 10.1109\/IPDPS.2008.4536313","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Bulu\u00e7 A, Madduri K (2011) Parallel breadth-first search on distributed-memory systems. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201911, pp 65:1\u201365:12. ACM, New York, NY, USA. doi: 10.1145\/2063384.2063471","DOI":"10.1145\/2063384.2063471"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Checconi F, Petrini F (2014) Traversing trillions of edges in real time: graph exploration on large-scale parallel machines. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp 425\u2013434. doi: 10.1109\/IPDPS.2014.52","DOI":"10.1109\/IPDPS.2014.52"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Checconi F, Petrini F, Willcock J, Lumsdaine A, Choudhury AR, Sabharwal Y (2012) Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC \u201912, pp 13:1\u201313:12. IEEE Computer Society Press, Los Alamitos, CA, USA. http:\/\/dl.acm.org\/citation.cfm?id=2388996.2389014","DOI":"10.1109\/SC.2012.25"},{"key":"24_CR8","unstructured":"Graph500: http:\/\/www.graph500.org\/"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ipl.2004.01.014","volume":"90","author":"E Montagne","year":"2004","unstructured":"Montagne E, Ekambaram A (2004) An optimal storage format for sparse matrices. Inf Process Lett 90(2):87\u201392. doi: 10.1016\/j.ipl.2004.01.014","journal-title":"Inf Process Lett"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Satish N, Kim C, Chhugani J, Dubey P (2012) Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing. In: 2012 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp 1\u201311. doi: 10.1109\/SC.2012.70","DOI":"10.1109\/SC.2012.70"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Suzumura T, Ueno K, Sato H, Fujisawa K, Matsuoka S (2011) Performance characteristics of graph500 on large-scale distributed environment. In: Proceedings of the 2011 IEEE International Symposium on Workload Characterization, IISWC \u201911, pp 149\u2013158. IEEE Computer Society, Washington, DC, USA. doi: 10.1109\/IISWC.2011.6114175","DOI":"10.1109\/IISWC.2011.6114175"},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Ueno K, Suzumura T (2012) Highly scalable graph search for the graph500 benchmark. In: Proceedings of the 21st International Symposium on High-Performance Parallel and Distributed Computing, HPDC \u201912, pp 149\u2013160. ACM, New York, NY, USA. doi: 10.1145\/2287076.2287104","DOI":"10.1145\/2287076.2287104"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Ueno K, Suzumura T (2013) Parallel distributed breadth first search on GPU. In: 20th Annual International Conference on High Performance Computing, pp 314\u2013323. doi: 10.1109\/HiPC.2013.6799136","DOI":"10.1109\/HiPC.2013.6799136"},{"key":"24_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07518-1_23","volume-title":"Fast and energy-efficient Breadth-First Search on a single NUMA system","author":"Y Yasui","year":"2014","unstructured":"Yasui Y, Fujisawa K (2014) Fast and energy-efficient Breadth-First Search on a single NUMA system. Springer International Publishing, Cham. doi: 10.1007\/978-3-319-07518-1_23"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Yokokawa M, Shoji F, Uno A, Kurokawa M, Watanabe T (2011) The k computer: Japanese next-generation supercomputer development project. In: Proceedings of the 17th IEEE\/ACM International Symposium on Low-power Electronics and Design, ISLPED \u201911, pp 371\u2013372. IEEE Press, Piscataway, NJ, USA. http:\/\/dl.acm.org\/citation.cfm?id=2016802.2016889","DOI":"10.1109\/ISLPED.2011.5993668"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Yoo A, Chow E, Henderson K, McLendon W, Hendrickson B, Catalyurek U (2005) A scalable distributed parallel breadth-first search algorithm on bluegene\/l. In: Proceedings of the 2005 ACM\/IEEE conference on Supercomputing, SC \u201905, pp 25. IEEE Computer Society, Washington, DC, USA. doi: 10.1109\/SC.2005.4","DOI":"10.1109\/SC.2005.4"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0024-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-016-0024-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0024-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:38:00Z","timestamp":1498361880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-016-0024-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,9]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s41019-016-0024-y","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,9]]}}}