{"id":"https://openalex.org/W4281879012","doi":"https://doi.org/10.1201/9781003033707-2","title":"A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers)","display_name":"A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers)","publication_year":2022,"publication_date":"2022-05-26","ids":{"openalex":"https://openalex.org/W4281879012","doi":"https://doi.org/10.1201/9781003033707-2"},"language":"en","primary_location":{"id":"doi:10.1201/9781003033707-2","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003033707-2","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027618658","display_name":"Charles E. Leiserson","orcid":"https://orcid.org/0000-0001-6386-5552"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Charles E. Leiserson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018454153","display_name":"Tao B. Schardl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao B. Schardl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14516129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9905999898910522,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9905999898910522,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9851999878883362,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/multithreading","display_name":"Multithreading","score":0.8868808746337891},{"id":"https://openalex.org/keywords/reducer","display_name":"Reducer","score":0.7996816635131836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7507637739181519},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5597617626190186},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5146992802619934},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.48311734199523926},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4676472842693329},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4621044099330902},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4295293688774109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4072316288948059},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.22510641813278198},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2054113745689392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.175764262676239},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10200455784797668}],"concepts":[{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.8868808746337891},{"id":"https://openalex.org/C2776985865","wikidata":"https://www.wikidata.org/wiki/Q26820931","display_name":"Reducer","level":2,"score":0.7996816635131836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7507637739181519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5597617626190186},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5146992802619934},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.48311734199523926},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4676472842693329},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4621044099330902},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4295293688774109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4072316288948059},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.22510641813278198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2054113745689392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.175764262676239},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10200455784797668},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781003033707-2","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003033707-2","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4281235","https://openalex.org/W2472610","https://openalex.org/W11378732","https://openalex.org/W6426808","https://openalex.org/W11539867","https://openalex.org/W9401246","https://openalex.org/W5243928","https://openalex.org/W3793245","https://openalex.org/W6899713","https://openalex.org/W1353218"],"abstract_inverted_index":{"Algorithms":[0],"to":[1,68],"search":[2],"a":[3,6,93,102],"graph":[4],"in":[5,75],"breadth-first":[7],"manner":[8],"have":[9],"been":[10],"studied":[11],"for":[12,96,104],"over":[13,131],"50":[14],"years.":[15],"The":[16,42,55,81,99],"main":[17],"body":[18],"of":[19,60,73,79,88,115,122],"this":[20],"chapter":[21,43,56,82,100],"describes":[22,36,50,57,66],"PBFS":[23,37,53],"and":[24,28,38],"its":[25,32,39],"empirical":[26,40],"performance":[27],"then":[29],"delves":[30],"into":[31],"theoretical":[33,77,113],"analysis.":[34],"It":[35,49,65,91,110],"performance.":[41],"provides":[44,83],"background":[45,84],"on":[46,85],"dynamic":[47,89],"multithreading.":[48,90],"the":[51,58,61,71,76,86,112,120,123],"basic":[52],"algorithm.":[54],"implementation":[59],"bag":[62],"data":[63],"structure.":[64],"how":[67],"cope":[69],"with":[70],"nondeterminism":[72],"reducers":[74],"analysis":[78],"PBFS.":[80],"theory":[87,103],"gives":[92],"formal":[94],"model":[95,114],"reducer":[97],"behavior.":[98],"develops":[101],"analyzing":[105],"programs":[106],"that":[107],"use":[108],"reducers.":[109],"overviews":[111],"Cilk-like":[116],"parallel":[117],"computation.":[118],"Despite":[119],"simplicity":[121],"TLS":[124,132],"solution,":[125],"reducer-based":[126],"solutions":[127],"exhibit":[128],"some":[129],"advantages":[130],"solutions.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}