{"id":"https://openalex.org/W2158697867","doi":"https://doi.org/10.1145/2141702.2141715","title":"Massively parallel breadth first search using a tree-structured memory model","display_name":"Massively parallel breadth first search using a tree-structured memory model","publication_year":2012,"publication_date":"2012-02-26","ids":{"openalex":"https://openalex.org/W2158697867","doi":"https://doi.org/10.1145/2141702.2141715","mag":"2158697867"},"language":"en","primary_location":{"id":"doi:10.1145/2141702.2141715","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2141702.2141715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores","raw_type":"proceedings-article"},"type":"article","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/A5061911203","display_name":"Tom St. John","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tom St. John","raw_affiliation_strings":["University of Delaware"],"affiliations":[{"raw_affiliation_string":"University of Delaware","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070127018","display_name":"Jack B. Dennis","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jack B. Dennis","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046024163","display_name":"Guang R. Gao","orcid":"https://orcid.org/0000-0002-5265-7528"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guang R. Gao","raw_affiliation_strings":["University of Delaware"],"affiliations":[{"raw_affiliation_string":"University of Delaware","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061911203"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":1.1711,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79893271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"123"},"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.9994000196456909,"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.9994000196456909,"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.9988999962806702,"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.9955000281333923,"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/massively-parallel","display_name":"Massively parallel","score":0.7893218994140625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7779437303543091},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6909400224685669},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6386106014251709},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6270620226860046},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4685783088207245},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4663951098918915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46530941128730774},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4253224730491638},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2766517996788025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14992958307266235},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13706368207931519},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09951871633529663}],"concepts":[{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.7893218994140625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7779437303543091},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6909400224685669},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6386106014251709},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6270620226860046},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4685783088207245},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4663951098918915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46530941128730774},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4253224730491638},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2766517996788025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14992958307266235},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13706368207931519},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09951871633529663}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2141702.2141715","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2141702.2141715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores","raw_type":"proceedings-article"},{"id":"pmh:oai:udspace.udel.edu:19716/12804","is_oa":false,"landing_page_url":"http://udspace.udel.edu/handle/19716/12804","pdf_url":null,"source":{"id":"https://openalex.org/S4377196565","display_name":"Library, Museums and Press - UDSpace (University of Delaware)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I86501945","host_organization_name":"University of Delaware","host_organization_lineage":["https://openalex.org/I86501945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.652.9458","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.652.9458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.capsl.udel.edu/pub/doc/papers/stjohn_pmam12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.653.2022","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.653.2022","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.capsl.udel.edu/pub/doc/memos/memo114.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3962934098","display_name":null,"funder_award_id":"CCF-0937907","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W51686622","https://openalex.org/W120254435","https://openalex.org/W595649129","https://openalex.org/W1517405987","https://openalex.org/W1843718812","https://openalex.org/W1964259417","https://openalex.org/W2012381119","https://openalex.org/W2046526098","https://openalex.org/W2072725684","https://openalex.org/W2091546631","https://openalex.org/W2131296084","https://openalex.org/W2134227179","https://openalex.org/W2141389982","https://openalex.org/W2141662114","https://openalex.org/W2152907584","https://openalex.org/W2162830667","https://openalex.org/W2406624003","https://openalex.org/W2752885492","https://openalex.org/W2911830835","https://openalex.org/W4234858060","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2023839151","https://openalex.org/W1774183074","https://openalex.org/W2057488824","https://openalex.org/W2334687145","https://openalex.org/W2178011914","https://openalex.org/W4235962491","https://openalex.org/W2061778832","https://openalex.org/W1513001507","https://openalex.org/W2257153718","https://openalex.org/W3134702077"],"abstract_inverted_index":{"Analysis":[0],"of":[1,34,52,62],"massive":[2],"graphs":[3],"has":[4],"emerged":[5],"as":[6,44],"an":[7],"important":[8],"area":[9],"for":[10],"massively":[11],"parallel":[12],"computation.":[13],"In":[14],"this":[15],"paper,":[16],"it":[17],"is":[18,57],"shown":[19],"how":[20],"the":[21,39],"Fresh":[22],"Breeze":[23],"trees-of-chunks":[24],"memory":[25],"model":[26],"may":[27],"be":[28,42,55],"used":[29],"to":[30,54],"perform":[31],"breadth-first":[32],"search":[33],"large":[35],"undirected":[36],"graphs.":[37],"Overall,":[38],"computation":[40],"can":[41],"expressed":[43],"a":[45,50,60],"data":[46],"flow":[47],"process":[48],"wherein":[49],"set":[51,61],"vertices":[53],"searched":[56],"partitioned":[58],"into":[59],"sub-domains":[63],"and":[64],"processed":[65],"independently":[66],"by":[67],"many":[68],"concurrent":[69],"tasks.":[70]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}