{"id":"https://openalex.org/W2279753750","doi":"https://doi.org/10.1145/2833179.2833189","title":"Dynamic parallelism for simple and efficient GPU graph algorithms","display_name":"Dynamic parallelism for simple and efficient GPU graph algorithms","publication_year":2015,"publication_date":"2015-11-15","ids":{"openalex":"https://openalex.org/W2279753750","doi":"https://doi.org/10.1145/2833179.2833189","mag":"2279753750"},"language":"en","primary_location":{"id":"doi:10.1145/2833179.2833189","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2833179.2833189","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2833189&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2833189&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101435918","display_name":"Peter Zhang","orcid":"https://orcid.org/0000-0002-8271-0107"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Zhang","raw_affiliation_strings":["Indiana University, Bloomington, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049975311","display_name":"Eric Holk","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Holk","raw_affiliation_strings":["Indiana University, Bloomington, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055226874","display_name":"John Matty","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Matty","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061344709","display_name":"Samantha Misurda","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samantha Misurda","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033575254","display_name":"Marcin Zalewski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marcin Zalewski","raw_affiliation_strings":["Indiana University, Bloomington, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049551995","display_name":"Jonathan Chu","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Chu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028007059","display_name":"Scott McMillan","orcid":"https://orcid.org/0000-0003-1868-5178"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott McMillan","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074260102","display_name":"Andrew Lumsdaine","orcid":"https://orcid.org/0000-0002-9153-6622"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Lumsdaine","raw_affiliation_strings":["Indiana University, Bloomington, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN","institution_ids":["https://openalex.org/I4210119109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9977999925613403,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9972000122070312,"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.851643443107605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7834898233413696},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.7068599462509155},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6257378458976746},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5547555088996887},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.5541415214538574},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.47617048025131226},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47103554010391235},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.43110302090644836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41194623708724976},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2973828613758087},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09592702984809875}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.851643443107605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7834898233413696},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.7068599462509155},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6257378458976746},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5547555088996887},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.5541415214538574},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.47617048025131226},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47103554010391235},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.43110302090644836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41194623708724976},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2973828613758087},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09592702984809875},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2833179.2833189","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2833179.2833189","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2833189&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2833179.2833189","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2833179.2833189","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2833189&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G116927039","display_name":null,"funder_award_id":"FA8721-05-C-0003","funder_id":"https://openalex.org/F4320306078","funder_display_name":"U.S. Department of Defense"},{"id":"https://openalex.org/G2620134759","display_name":"SHF: Large: Collaborative Research: PXGL: Cyberinfrastructure for Scalable Graph Execution","funder_award_id":"1111888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5926907248","display_name":null,"funder_award_id":"Contract No. FA8721-05-C-0003","funder_id":"https://openalex.org/F4320306078","funder_display_name":"U.S. Department of Defense"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320309480","display_name":"Nvidia","ror":"https://ror.org/03jdj4y14"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2279753750.pdf","grobid_xml":"https://content.openalex.org/works/W2279753750.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1504291959","https://openalex.org/W1985291160","https://openalex.org/W2018481625","https://openalex.org/W2029940394","https://openalex.org/W2090278477","https://openalex.org/W2093739557","https://openalex.org/W2107173440","https://openalex.org/W2109473404"],"related_works":["https://openalex.org/W2950520577","https://openalex.org/W1501159154","https://openalex.org/W2003935582","https://openalex.org/W74409296","https://openalex.org/W1554644772","https://openalex.org/W2494130044","https://openalex.org/W2468095077","https://openalex.org/W29548032","https://openalex.org/W2593878938","https://openalex.org/W305742777"],"abstract_inverted_index":{"Dynamic":[0],"parallelism":[1,22,45],"allows":[2],"GPU":[3],"kernels":[4,8],"to":[5,46,48],"launch":[6],"additional":[7],"at":[9],"runtime":[10],"directly":[11],"from":[12],"the":[13,49,66,70,77,81],"GPU.":[14],"In":[15],"this":[16],"paper":[17],"we":[18],"show":[19],"that":[20,42,63],"dynamic":[21,44],"enables":[23],"relatively":[24],"simple":[25,61],"high-performance":[26],"graph":[27],"algorithms":[28,41,71],"for":[29],"GPUs.":[30],"We":[31],"present":[32],"breadth-first":[33],"search":[34],"(BFS)":[35],"and":[36,51],"single-source":[37],"shortest":[38],"paths":[39],"(SSSP)":[40],"use":[43],"adapt":[47],"irregular":[50],"data-driven":[52],"nature":[53],"of":[54,69,80],"these":[55],"problems.":[56],"Our":[57],"approach":[58],"results":[59],"in":[60],"code":[62],"closely":[64],"follows":[65],"high-level":[67],"description":[68],"but":[72],"yields":[73],"performance":[74],"competitive":[75],"with":[76],"current":[78],"state":[79],"art.":[82]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}