{"id":"https://openalex.org/W2961520796","doi":"https://doi.org/10.1109/hpcs48598.2019.9188204","title":"Configuring Graph Traversal Applications for GPUs: Analysis of Implementation Strategies and their Correlation with Graph Characteristics","display_name":"Configuring Graph Traversal Applications for GPUs: Analysis of Implementation Strategies and their Correlation with Graph Characteristics","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2961520796","doi":"https://doi.org/10.1109/hpcs48598.2019.9188204","mag":"2961520796"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs48598.2019.9188204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","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/A5053217543","display_name":"Federico Busato","orcid":null},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Federico Busato","raw_affiliation_strings":["Dept. Computer Science, University of Verona, Italy"],"affiliations":[{"raw_affiliation_string":"Dept. Computer Science, University of Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088231786","display_name":"Nicola Bombieri","orcid":"https://orcid.org/0000-0003-3256-5885"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Bombieri","raw_affiliation_strings":["Dept. Computer Science, University of Verona, Italy"],"affiliations":[{"raw_affiliation_string":"Dept. Computer Science, University of Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053217543"],"corresponding_institution_ids":["https://openalex.org/I119439378"],"apc_list":null,"apc_paid":null,"fwci":0.1012,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.42435908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"9","issue":null,"first_page":"145","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9969000220298767,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8380132913589478},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6859237551689148},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6828683018684387},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6796790361404419},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.549299955368042},{"id":"https://openalex.org/keywords/power-graph-analysis","display_name":"Power graph analysis","score":0.5129237174987793},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.42120957374572754},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.41284337639808655},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4112662672996521},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2929334044456482}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8380132913589478},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6859237551689148},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6828683018684387},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6796790361404419},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.549299955368042},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.5129237174987793},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.42120957374572754},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.41284337639808655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4112662672996521},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2929334044456482},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs48598.2019.9188204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1504291959","https://openalex.org/W1556784394","https://openalex.org/W1770249075","https://openalex.org/W1985291160","https://openalex.org/W2035080386","https://openalex.org/W2041470524","https://openalex.org/W2059966434","https://openalex.org/W2107173440","https://openalex.org/W2109473404","https://openalex.org/W2139882553","https://openalex.org/W2143114052","https://openalex.org/W2397037157","https://openalex.org/W2502734103","https://openalex.org/W2555931724","https://openalex.org/W2559809597","https://openalex.org/W2885584288","https://openalex.org/W2897673878","https://openalex.org/W2951135776","https://openalex.org/W4247828381","https://openalex.org/W6659374036","https://openalex.org/W6732605532"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W2152421698","https://openalex.org/W2366394613"],"abstract_inverted_index":{"Implementing":[0],"a":[1,9,15,112,148],"graph":[2,20,59,88,140],"traversal":[3,89],"(GT)":[4],"algorithm":[5,42],"for":[6,18,101,124,180],"GPUs":[7,102,183],"is":[8,14],"very":[10,113],"challenging":[11],"task.":[12],"It":[13,91],"core":[16],"primitive":[17],"many":[19],"analysis":[21,65,150],"applications":[22,179],"and":[23,85,103,115,127,151],"its":[24],"efficiency":[25,50],"strongly":[26,55],"impacts":[27],"on":[28,57,111,162,182],"the":[29,40,45,49,58,67,72,104,134,139,176,185,188],"overall":[30],"application":[31],"performance.":[32],"Different":[33],"strategies":[34],"have":[35],"been":[36],"proposed":[37],"to":[38,95,137,159,171,175],"implement":[39,96],"GT":[41,74,181],"by":[43],"exploiting":[44],"GPU":[46,164],"characteristics.":[47,60,141],"Nevertheless,":[48],"of":[51,53,66,71,98,106,118,132,187],"each":[52,97,125],"them":[54],"depends":[56],"This":[61],"paper":[62,143],"presents":[63,145],"an":[64],"most":[68],"important":[69],"features":[70,100],"parallel":[73,178],"algorithm,":[75],"which":[76],"include":[77],"frontier":[78],"queue":[79],"management,":[80],"load":[81],"balancing,":[82],"duplicate":[83],"removing,":[84],"synchronization":[86],"during":[87],"iterations.":[90],"shows":[92],"different":[93,129],"techniques":[94,131],"such":[99,147],"comparison":[105],"their":[107],"performance":[108],"when":[109],"applied":[110],"large":[114],"heterogeneous":[116],"set":[117,152],"graphs.":[119],"The":[120,142],"results":[121],"allow":[122,153],"identifying,":[123],"feature":[126],"among":[128],"implementation":[130],"them,":[133],"best":[135,177],"configuration":[136,149],"address":[138],"finally":[144],"how":[146],"traversing":[154],"graphs":[155],"with":[156,166,173],"throughput":[157],"up":[158],"14,000":[160],"MTEPS":[161],"single":[163],"devices,":[165],"speedups":[167],"ranging":[168],"from":[169],"1.2x":[170],"18.5x":[172],"regard":[174],"at":[184],"state":[186],"art.":[189]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}