{"id":"https://openalex.org/W4410037160","doi":"https://doi.org/10.1145/3711708.3723449","title":"Optimized Parallel Breadth-First Search with Adaptive Strategies","display_name":"Optimized Parallel Breadth-First Search with Adaptive Strategies","publication_year":2025,"publication_date":"2025-03-01","ids":{"openalex":"https://openalex.org/W4410037160","doi":"https://doi.org/10.1145/3711708.3723449"},"language":"en","primary_location":{"id":"doi:10.1145/3711708.3723449","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723449","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723449","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st FastCode Programming Challenge","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723449","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076616132","display_name":"Caiyi Li","orcid":null},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chaoqun Li","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"],"raw_orcid":"https://orcid.org/0009-0002-7559-0626","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Runbang Hu","orcid":"https://orcid.org/0009-0005-0901-530X"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Runbang Hu","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"],"raw_orcid":"https://orcid.org/0009-0005-0901-530X","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060514022","display_name":"Xiaojiang Du","orcid":"https://orcid.org/0000-0003-4235-9671"},"institutions":[{"id":"https://openalex.org/I108468826","display_name":"Stevens Institute of Technology","ror":"https://ror.org/02z43xh36","country_code":"US","type":"education","lineage":["https://openalex.org/I108468826"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaojiang Du","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-4235-9671","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ, USA","institution_ids":["https://openalex.org/I108468826"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066436066","display_name":"Yuede Ji","orcid":"https://orcid.org/0000-0002-2419-6592"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuede Ji","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-2419-6592","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9349,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73971507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"28","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6739808917045593},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4927716553211212},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3298981487751007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2305191159248352}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6739808917045593},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4927716553211212},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3298981487751007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2305191159248352}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3711708.3723449","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723449","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723449","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st FastCode Programming Challenge","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3711708.3723449","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723449","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723449","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st FastCode Programming Challenge","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/2","display_name":"Zero hunger"}],"awards":[{"id":"https://openalex.org/G4069150422","display_name":null,"funder_award_id":"2516003","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5725191492","display_name":null,"funder_award_id":"2331301","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6520398314","display_name":null,"funder_award_id":"2419843","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G987690146","display_name":null,"funder_award_id":"2508118","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410037160.pdf","grobid_xml":"https://content.openalex.org/works/W4410037160.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1993449345","https://openalex.org/W2038570785","https://openalex.org/W2047345171","https://openalex.org/W2126004407","https://openalex.org/W2154111453","https://openalex.org/W2158626084","https://openalex.org/W2435994428","https://openalex.org/W2796060671","https://openalex.org/W2902940306","https://openalex.org/W2950537538","https://openalex.org/W3008003211","https://openalex.org/W3013652274","https://openalex.org/W3090369187","https://openalex.org/W4384129390","https://openalex.org/W4388031360","https://openalex.org/W4389104738","https://openalex.org/W4392902681"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Breadth-First":[0],"Search":[1],"(BFS)":[2],"is":[3],"a":[4,10,41,66,116,137],"fundamental":[5],"graph":[6,51,87,92,154],"traversal":[7,78],"algorithm":[8],"in":[9,18,108,152],"level-by-level":[11],"pattern.":[12],"It":[13,80],"has":[14],"been":[15],"widely":[16],"used":[17],"real-world":[19],"applications,":[20],"such":[21],"as":[22],"social":[23],"network":[24],"analysis,":[25],"scientific":[26],"computing,":[27],"and":[28,53,76,96,113],"web":[29],"crawling.":[30],"However,":[31],"achieving":[32],"high":[33],"performance":[34],"for":[35,56],"BFS":[36,70,133],"on":[37,73,104,136],"large-scale":[38],"graphs":[39,107],"remains":[40],"challenging":[42],"task":[43],"due":[44],"to":[45],"irregular":[46],"memory":[47],"access":[48],"patterns,":[49],"diverse":[50,106],"structures,":[52],"the":[54,74,131],"necessity":[55],"efficient":[57,97],"parallelization.":[58],"This":[59],"paper":[60],"addresses":[61],"these":[62],"challenges":[63],"by":[64],"designing":[65],"highly":[67],"optimized":[68],"parallel":[69,98],"implementation":[71],"based":[72],"top-down":[75],"bottom-up":[77],"strategies.":[79],"further":[81],"integrates":[82],"several":[83],"key":[84],"innovations,":[85],"including":[86],"type-aware":[88],"computation":[89],"strategy":[90],"selection,":[91],"pruning,":[93],"two-level":[94],"bottom-up,":[95],"implementation.":[99,134],"We":[100],"evaluate":[101],"our":[102,122,141],"method":[103,123,142],"11":[105],"terms":[109],"of":[110,128],"size,":[111],"diameter,":[112],"density.":[114],"On":[115],"CPU":[117],"server":[118],"with":[119],"48":[120],"threads,":[121],"achieves":[124],"an":[125],"average":[126],"speedup":[127],"9.5\u00d7":[129],"over":[130],"serial":[132],"Also,":[135],"synthetic":[138],"dense":[139,153],"graph,":[140],"processes":[143],"9.3":[144],"billion":[145],"edges":[146],"per":[147],"second,":[148],"showing":[149],"its":[150],"efficiency":[151],"traversal.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}