{"id":"https://openalex.org/W3208332561","doi":"https://doi.org/10.1145/3468081.3471122","title":"GPU Parallelization of All-Pairs-Shortest-Path Algorithm in Low-Degree Unweighted Regular Graph","display_name":"GPU Parallelization of All-Pairs-Shortest-Path Algorithm in Low-Degree Unweighted Regular Graph","publication_year":2021,"publication_date":"2021-06-20","ids":{"openalex":"https://openalex.org/W3208332561","doi":"https://doi.org/10.1145/3468081.3471122","mag":"3208332561"},"language":"en","primary_location":{"id":"doi:10.1145/3468081.3471122","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3468081.3471122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the the 8th International Virtual Conference on Applied Computing &amp; Information Technology","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/A5059294235","display_name":"Ryuta Kawano","orcid":"https://orcid.org/0000-0001-8918-0674"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Ryuta Kawano","raw_affiliation_strings":["Japan Advanced Institute of Science and Technology, Japan"],"affiliations":[{"raw_affiliation_string":"Japan Advanced Institute of Science and Technology, Japan","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041549339","display_name":"Hiroki Matsutani","orcid":"https://orcid.org/0000-0001-9578-3842"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroki Matsutani","raw_affiliation_strings":["Keio University, Japan"],"affiliations":[{"raw_affiliation_string":"Keio University, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029236003","display_name":"Michihiro Koibuchi","orcid":"https://orcid.org/0000-0002-5790-6992"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Michihiro Koibuchi","raw_affiliation_strings":["National Institute of Informatics, Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113742339","display_name":"Hideharu Amano","orcid":null},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hideharu Amano","raw_affiliation_strings":["Keio University, Japan"],"affiliations":[{"raw_affiliation_string":"Keio University, Japan","institution_ids":["https://openalex.org/I203951103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059294235"],"corresponding_institution_ids":["https://openalex.org/I177738480"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13575163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/adjacency-matrix","display_name":"Adjacency matrix","score":0.7905301451683044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6845264434814453},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6524322032928467},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6372323036193848},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.552117109298706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5024971961975098},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4917941391468048},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47215843200683594},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44907504320144653},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4154849350452423},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3350321054458618},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2048206627368927}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.7905301451683044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6845264434814453},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6524322032928467},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6372323036193848},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.552117109298706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5024971961975098},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4917941391468048},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47215843200683594},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44907504320144653},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4154849350452423},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3350321054458618},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2048206627368927},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3468081.3471122","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3468081.3471122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the the 8th International Virtual Conference on Applied Computing &amp; Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1995597621","https://openalex.org/W2007572995","https://openalex.org/W2058426370","https://openalex.org/W2113933854","https://openalex.org/W2163769126","https://openalex.org/W2912219071","https://openalex.org/W2995145112","https://openalex.org/W3145732157"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2117632582","https://openalex.org/W4388347373"],"abstract_inverted_index":{"The":[0],"design":[1],"of":[2,6,58,69,93],"the":[3,20,25,35,46,59,65,70,77,82,90,94,112,122],"network":[4],"topology":[5],"a":[7,86,104],"large-scale":[8],"parallel":[9],"computer":[10],"system":[11],"can":[12],"be":[13],"represented":[14],"as":[15,85],"an":[16],"order/degree":[17,26],"problem":[18],"in":[19,64,89],"graph":[21],"theory.":[22],"To":[23],"solve":[24],"problem,":[27],"we":[28],"have":[29],"to":[30,117,121],"obtain":[31],"all-pairs-shortest-path":[32],"(APSP)":[33],"for":[34,41],"graph.":[36],"A":[37],"conventional":[38,123],"APSP":[39,78],"algorithm":[40,79,102],"GPUs":[42],"is":[43],"based":[44],"on":[45,52,103],"adjacency":[47,83],"matrix":[48,60,84,88],"(ADJ-APSP).":[49],"When":[50],"focusing":[51],"low-degree":[53],"and":[54],"unweighted":[55],"graphs,":[56],"most":[57],"elements":[61],"are":[62],"zero":[63],"first":[66,91],"few":[67],"iterations":[68,92],"algorithm.":[71,95,124],"We":[72],"will":[73],"further":[74],"speed":[75],"up":[76,116],"by":[80,115],"treating":[81],"sparse":[87],"Evaluation":[96],"results":[97],"show":[98],"that":[99],"our":[100],"proposed":[101],"single":[105],"GPU":[106],"(NVIDIA":[107],"GeForce":[108],"RTX":[109],"3080)":[110],"reduces":[111],"execution":[113],"time":[114],"32.7":[118],"%":[119],"compared":[120]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
