{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:53:20Z","timestamp":1775300000058,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030050535","type":"print"},{"value":"9783030050542","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05054-2_9","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:33:21Z","timestamp":1544124801000},"page":"114-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Low Communication Overhead Breadth-First Search Based on Global Bitmap"],"prefix":"10.1007","author":[{"given":"Ziwei","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiguang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunfei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"9_CR1","unstructured":"Graph\u00a0500 benchmark. https:\/\/graph500.org\/"},{"key":"9_CR2","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), Austin, TX, pp. 149\u2013158 (2011)","DOI":"10.1109\/IISWC.2011.6114175"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In: 2006 International Conference on Parallel Processing (ICPP 2006), Columbus, OH, pp. 523\u2013530 (2006)","DOI":"10.1109\/ICPP.2006.34"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Mizell, D., Maschhoff, K.: Early experiences with large-scale Cray XMT systems. In: 2009 IEEE International Symposium on Parallel & Distributed Processing, Rome, pp. 1\u20139 (2009). https:\/\/doi.org\/10.1109\/ipdps.2009.5161108","DOI":"10.1109\/ipdps.2009.5161108"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Agarwal, V., Petrini, F., Pasetto, D., Bader, D.A.: Scalable graph exploration on multicore processors. In: 2010 ACM\/IEEE International Conference for High Performance Computing. Networking, Storage and Analysis, New Orleans, LA, pp. 1\u201311 (2010)","DOI":"10.1109\/SC.2010.46"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Yasui, Y., Fujisawa, K.: Fast and scalable NUMA-based thread parallel breadth-first search. In: 2015 International Conference on High Performance Computing & Simulation (HPCS), Amsterdam, pp. 377\u2013385 (2015)","DOI":"10.1109\/HPCSim.2015.7237065"},{"key":"9_CR7","unstructured":"Beamer, S., Asanovic, K., Patterson, D.A.: Searching for a parent instead of fighting over children: a fast breadth-first search implementation for Graph500. EECS Department, University of California, Berkeley, Technical report. UCB\/EECS-2011-117, November 2011"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovic, K., Patterson, D.: Direction-optimizing breadth-first search. In: International Conference on High PERFORMANCE Computing, Networking, Storage and Analysis, vol. 21, p. 12. IEEE Computer Society Press (2012)","DOI":"10.1109\/SC.2012.50"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., Catalyurek, U.: A scalable distributed parallel breadth-first search algorithm on BlueGene\/L. In: Proceedings of the ACM\/IEEE SC 2005 Conference on Supercomputing, p. 25 (2005). https:\/\/doi.org\/10.1109\/sc.2005.4","DOI":"10.1109\/sc.2005.4"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chow, E., Henderson, K., Yoo, A.: Distributed breadth-first search with 2-D partitioning. Lawrence Livermore Nat Lab (2005)","DOI":"10.2172\/919217"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A.: Parallel breadth-first search on distributed memory systems. In: Computer Science, pp. 1\u201312 (2011)","DOI":"10.1145\/2063384.2063471"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Checconi, F., Petrini, F., Willcock, J., Lumsdaine, A., Choudhury, A.R., Sabharwal, Y.: Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. In: 2012 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), Salt Lake City, UT, pp. 1\u201312 (2012). https:\/\/doi.org\/10.1109\/sc.2012.25","DOI":"10.1109\/sc.2012.25"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Satish, N., Kim, C., Chhugani, J., Dubey, P.: 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), Salt Lake City, UT, pp. 1\u201311 (2012)","DOI":"10.1109\/SC.2012.70"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Checconi, F., Petrini, F.: Traversing trillions of edges in real time: graph exploration on large-scale parallel machines. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, Phoenix, AZ, pp. 425\u2013434 (2014)","DOI":"10.1109\/IPDPS.2014.52"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Beamer, S., Buluc, A., Asanovic, K., et al.: Distributed memory breadth-first search revisited: enabling bottom-up search. In: Proceedings of the IEEE 27th International Parallel Distributed Processing Symposium Workshop and PhD Forum, IPDPSW 2013, pp. 1618\u20131627 (2013)","DOI":"10.1109\/IPDPSW.2013.159"},{"issue":"8","key":"9_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/2370036.2145832","volume":"47","author":"D Merrill","year":"2012","unstructured":"Merrill, D., Garland, M., Grimshaw, A.: Scalable GPU graph traversal. ACM SIGPLAN Not. 47(8), 117\u2013128 (2012)","journal-title":"ACM SIGPLAN Not."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Hong, S., Oguntebi, T., Olukotun, K.: Efficient parallel graph exploration on multi-core CPU and GPU. In: 2011 International Conference on Parallel Architectures and Compilation Techniques, Galveston, TX, pp. 78\u201388 (2011)","DOI":"10.1109\/PACT.2011.14"},{"key":"9_CR18","unstructured":"Best Practice Guide \u2013 Knights Landing. http:\/\/www.prace-ri.eu\/best-practice-guide-knights-landing-january-2017\/"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05054-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:55:25Z","timestamp":1775296525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05054-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050535","9783030050542"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05054-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}