{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:52:31Z","timestamp":1648903951496},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2012,5,23]],"date-time":"2012-05-23T00:00:00Z","timestamp":1337731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Sci Res Dev"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00450-012-0207-3","type":"journal-article","created":{"date-parts":[[2012,5,22]],"date-time":"2012-05-22T07:52:43Z","timestamp":1337673163000},"page":"193-201","source":"Crossref","is-referenced-by-count":4,"title":["Understanding parallelism in graph traversal on multi-core clusters"],"prefix":"10.1007","volume":"28","author":[{"given":"Huiwei","family":"Lv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangming","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ninghui","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,23]]},"reference":[{"key":"207_CR1","unstructured":"The Graph 500 List (2011). http:\/\/www.graph500.org\/"},{"key":"207_CR2","unstructured":"The Linpack Benchmark (2011). http:\/\/www.top500.org\/project\/linpack"},{"key":"207_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SC.2010.46","volume-title":"Proceedings of the 2010 ACM\/IEEE international conference for high performance computing, networking, storage and analysis, SC\u201910","author":"V Agarwal","year":"2010","unstructured":"Agarwal V, Petrini F, Pasetto D, Bader DA (2010) Scalable graph exploration on multicore processors. In: Proceedings of the 2010 ACM\/IEEE international conference for high performance computing, networking, storage and analysis, SC\u201910. IEEE Comput Soc, Washington, pp 1\u201311"},{"key":"207_CR4","doi-asserted-by":"crossref","first-page":"1366","DOI":"10.1016\/j.jpdc.2006.06.001","volume":"66","author":"DA Bader","year":"2006","unstructured":"Bader DA, Cong G (2006) Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. J\u00a0Parallel Distrib Comput 66:1366\u20131378","journal-title":"J\u00a0Parallel Distrib Comput"},{"key":"207_CR5","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/ICPP.2006.34","volume-title":"Proceedings of the 2006 international conference on parallel processing, ICPP\u201906","author":"DA Bader","year":"2006","unstructured":"Bader DA, Madduri K (2006) Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In: Proceedings of the 2006 international conference on parallel processing, ICPP\u201906. IEEE Comput Soc, Washington, pp 523\u2013530"},{"key":"207_CR6","author":"A Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7 A, Gilbert JR (2011) The Combinatorial BLAS: design, implementation, and applications. Int J High Perform Comput Appl. doi: 10.1.1.185.4283","journal-title":"Int J High Perform Comput Appl"},{"key":"207_CR7","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Madduri K (2011) Parallel breadth-first search on distributed memory systems. Corros Rev. arXiv:1104.4518","DOI":"10.1145\/2063384.2063471"},{"key":"207_CR8","volume-title":"Proceedings of the 2000 ACM\/IEEE conference on supercomputing (CDROM), Supercomputing\u201900","author":"F Cappello","year":"2000","unstructured":"Cappello F, Etiemble D (2000) MPI versus MPI+OpenMP on IBM SP for the NAS Benchmarks. In: Proceedings of the 2000 ACM\/IEEE conference on supercomputing (CDROM), Supercomputing\u201900. IEEE Comput Soc, Washington"},{"key":"207_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1345206.1345215","volume-title":"Proceedings of the 13th ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP\u201908","author":"J Giacomoni","year":"2008","unstructured":"Giacomoni J, Moseley T, Vachharajani M (2008) FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue. In: Proceedings of the 13th ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP\u201908. ACM, New York, pp 43\u201352"},{"key":"207_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1594835.1504182","volume":"44","author":"S Kang","year":"2009","unstructured":"Kang S, Bader DA (2009) An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. ACM SIGPLAN Not 44:15\u201324","journal-title":"ACM SIGPLAN Not"},{"key":"207_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/1810479.1810534","volume-title":"Proceedings of the 22nd ACM symposium on parallelism in algorithms and architectures, SPAA\u201910","author":"CE Leiserson","year":"2010","unstructured":"Leiserson CE, Schardl TB (2010) A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In: Proceedings of the 22nd ACM symposium on parallelism in algorithms and architectures, SPAA\u201910. ACM, New York, pp 303\u2013314"},{"key":"207_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/11564126_17","volume-title":"Knowledge discovery in databases: PKDD 2005","author":"J Leskovec","year":"2005","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2005) Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In: Jorge A, Torgo L, Brazdil P, Camacho R, Gama J (eds) Knowledge discovery in databases: PKDD 2005. Lecture notes in computer science, vol 3721. Springer, Berlin, pp 133\u2013145"},{"key":"207_CR13","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/582034.582052","volume-title":"Proceedings of the 2001 ACM\/IEEE conference on supercomputing (CDROM), Supercomputing\u201901","author":"RD Loft","year":"2001","unstructured":"Loft RD, Thomas SJ, Dennis JM (2001) Terascale spectral element dynamical core for atmospheric general circulation models. In: Proceedings of the 2001 ACM\/IEEE conference on supercomputing (CDROM), Supercomputing\u201901. ACM, New York, p\u00a018"},{"issue":"1","key":"207_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine A, Gregor D, Hendrickson B, Berry J (2007) Challenges in parallel graph processing. Parallel Process Lett 17(1):5\u201320","journal-title":"Parallel Process Lett"},{"key":"207_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/IPDPS.2009.5161108","volume-title":"Proceedings of the 2009 IEEE international symposium on parallel & distributed processing","author":"D Mizell","year":"2009","unstructured":"Mizell D, Maschhoff K (2009) Early experiences with large-scale Cray XMT systems. In: Proceedings of the 2009 IEEE international symposium on parallel & distributed processing. IEEE Comput Soc, Washington, pp 1\u20139"},{"key":"207_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/PACT.2009.22","volume-title":"Proceedings of the 2009 18th international conference on parallel architectures and compilation techniques","author":"D Molka","year":"2009","unstructured":"Molka D, Hackenberg D, Schone R, Muller MS (2009) Memory performance and cache coherency effects on an intel nehalem multiprocessor system. In: Proceedings of the 2009 18th international conference on parallel architectures and compilation techniques. IEEE Comput Soc, Washington, pp 261\u2013270"},{"key":"207_CR17","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1109\/TPDS.2007.70811","volume":"19","author":"DP Scarpazza","year":"2008","unstructured":"Scarpazza DP, Villa O, Petrini F (2008) Efficient breadth-first search on the Cell\/BE processor. IEEE Trans Parallel Distrib Syst 19:1381\u20131395","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"207_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11227-009-0339-9","volume":"56","author":"G Tan","year":"2011","unstructured":"Tan G, Sreedhar V, Gao G (2011) Analysis and performance results of computing betweenness centrality on IBM Cyclops64. J\u00a0Supercomput 56:1\u201324","journal-title":"J\u00a0Supercomput"},{"key":"207_CR19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/1964218.1964228","volume":"38","author":"X Wu","year":"2011","unstructured":"Wu X, Taylor V (2011) Performance characteristics of hybrid MPI\/OpenMP implementations of NAS parallel benchmarks SP and BT on large-scale multicore supercomputers. ACM SIGMETRICS Perform Eval Rev 38:56\u201362","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"key":"207_CR20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/SC.2005.4","volume-title":"Proceedings of the 2005 ACM\/IEEE conference on supercomputing, SC\u201905","author":"A Yoo","year":"2005","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. IEEE Comput Soc, Washington, p 25"}],"container-title":["Computer Science - Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-012-0207-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00450-012-0207-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-012-0207-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T20:25:01Z","timestamp":1561753501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-012-0207-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,23]]},"references-count":20,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s00450-012-0207-3","relation":{},"ISSN":["1865-2034","1865-2042"],"issn-type":[{"value":"1865-2034","type":"print"},{"value":"1865-2042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,23]]}}}