{"id":"https://openalex.org/W7163569570","doi":"https://doi.org/10.23919/date69613.2026.11539323","title":"RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs","display_name":"RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs","publication_year":2026,"publication_date":"2026-04-20","ids":{"openalex":"https://openalex.org/W7163569570","doi":"https://doi.org/10.23919/date69613.2026.11539323"},"language":null,"primary_location":{"id":"doi:10.23919/date69613.2026.11539323","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date69613.2026.11539323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Design, Automation & Test in Europe Conference (DATE)","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/A5137829259","display_name":"Yanru Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yanru Chen","raw_affiliation_strings":["University of California San Diego,La Jolla,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego,La Jolla,CA,USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004372181","display_name":"Zheyu Li","orcid":"https://orcid.org/0000-0002-0022-3189"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zheyu Li","raw_affiliation_strings":["University of California San Diego,La Jolla,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego,La Jolla,CA,USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104295975","display_name":"Keming Fan","orcid":"https://orcid.org/0000-0002-6659-9971"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keming Fan","raw_affiliation_strings":["University of California San Diego,La Jolla,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego,La Jolla,CA,USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030074287","display_name":"Runyang Tian","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Runyang Tian","raw_affiliation_strings":["University of California San Diego,La Jolla,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego,La Jolla,CA,USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124252169","display_name":"John Hsu","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Hsu","raw_affiliation_strings":["University of California San Diego,La Jolla,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego,La Jolla,CA,USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039571679","display_name":"Weihong Xu","orcid":"https://orcid.org/0000-0003-3766-3353"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Weihong Xu","raw_affiliation_strings":["Ecole Polytechnique Fédérale de Lausanne,Lausanne,Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Polytechnique Fédérale de Lausanne,Lausanne,Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036778557","display_name":"Minxuan Zhou","orcid":"https://orcid.org/0000-0002-5523-7270"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Minxuan Zhou","raw_affiliation_strings":["Illinois Institute of Technology,Chicago,IL,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology,Chicago,IL,USA","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123248632","display_name":"Tajana Rosing","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tajana Rosing","raw_affiliation_strings":["University of California San Diego,La Jolla,CA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego,La Jolla,CA,USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":8,"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.9133122,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6531000137329102,"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.6531000137329102,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.0478999987244606,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.030400000512599945,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dynamic-programming","display_name":"Dynamic programming","score":0.5049999952316284},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4700999855995178},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.31290000677108765},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.30959999561309814},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.29339998960494995}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5105000138282776},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5049999952316284},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4700999855995178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43650001287460327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3952000141143799},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36660000681877136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3319000005722046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3172999918460846},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3000999987125397},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.29339998960494995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.2612999975681305}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date69613.2026.11539323","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date69613.2026.11539323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Design, Automation & Test in Europe Conference (DATE)","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":33,"referenced_works":["https://openalex.org/W1039385342","https://openalex.org/W2004951603","https://openalex.org/W2007572995","https://openalex.org/W2112090702","https://openalex.org/W2518281301","https://openalex.org/W2526202524","https://openalex.org/W2588191434","https://openalex.org/W2612654866","https://openalex.org/W2782087530","https://openalex.org/W2795118915","https://openalex.org/W2900379535","https://openalex.org/W2945827377","https://openalex.org/W2962903741","https://openalex.org/W2963955033","https://openalex.org/W2979858238","https://openalex.org/W3005783121","https://openalex.org/W3090014039","https://openalex.org/W3165570441","https://openalex.org/W3174859758","https://openalex.org/W3205654403","https://openalex.org/W4206962337","https://openalex.org/W4285092328","https://openalex.org/W4378574916","https://openalex.org/W4381327291","https://openalex.org/W4390749651","https://openalex.org/W4391110694","https://openalex.org/W4393870191","https://openalex.org/W4394009563","https://openalex.org/W4394998968","https://openalex.org/W4396220536","https://openalex.org/W4400409880","https://openalex.org/W4407692492","https://openalex.org/W4411233242"],"related_works":[],"abstract_inverted_index":{"All-pairs":[0],"shortest":[1],"paths":[2],"(APSP)":[3],"remains":[4],"a":[5,28,49,90,100,108],"major":[6],"bottleneck":[7],"for":[8],"large-scale":[9],"graph":[10],"analytics,":[11],"as":[12],"data":[13,66],"movement":[14],"with":[15],"cubic":[16],"complexity":[17],"overwhelms":[18],"the":[19,44,83,136],"bandwidth":[20],"of":[21],"conventional":[22],"memory":[23,97,106],"hierarchies.":[24],"We":[25],"propose":[26],"RAPID-Graph,":[27],"processing-in-memory":[29],"(PIM)":[30],"system":[31],"co-designed":[32],"across":[33],"algorithm,":[34],"architecture,":[35],"and":[36,72,85,103,127,144,163,174],"device":[37,86],"levels":[38],"to":[39,64,131,171],"address":[40],"this":[41],"challenge.":[42],"At":[43,82],"algorithm":[45],"level,":[46],"we":[47,88],"introduce":[48],"recursion-aware":[50],"partitioner":[51],"that":[52,69],"enables":[53],"an":[54,179],"exact":[55],"APSP":[56,119],"computation":[57],"by":[58,159],"decomposing":[59],"graphs":[60],"into":[61],"vertex":[62],"tiles":[63],"reduce":[65],"dependency,":[67],"such":[68],"both":[70,125],"Floyd-Warshall":[71],"Min-Plus":[73],"kernels":[74],"execute":[75],"fully":[76],"in-place":[77],"within":[78,107],"digital":[79],"PIM":[80,92,157],"arrays.":[81],"architecture":[84],"levels,":[87],"design":[89,123],"2.5D":[91],"stack":[93,116],"integrating":[94],"two":[95],"phase-change":[96],"compute":[98],"dies,":[99],"logic":[101],"die,":[102],"high-bandwidth":[104],"scratchpad":[105],"unified":[109],"advanced":[110],"package.":[111],"An":[112],"external":[113],"non-volatile":[114],"storage":[115],"stores":[117],"large":[118],"results":[120],"persistently.":[121],"The":[122],"achieves":[124],"tile-level":[126],"unit-level":[128],"parallel":[129],"processing":[130],"sustain":[132],"high":[133],"throughput.":[134],"On":[135],"2.45M-node":[137],"OGBN-Products":[138],"dataset,":[139],"RAPID-Graph":[140],"is":[141],"5.8\u00d7":[142],"faster":[143],"1":[145],"186\u00d7":[146],"more":[147],"energy":[148,176],"efficient":[149],"than":[150],"state-of-the-art":[151],"GPU":[152],"clusters,":[153],"while":[154],"exceeding":[155],"prior":[156],"accelerators":[158],"8.3\u00d7":[160],"in":[161,165],"speed":[162],"104\u00d7":[164],"efficiency.":[166],"It":[167],"further":[168],"delivers":[169],"up":[170],"42.8\u00d7":[172],"speedup":[173],"392\u00d7":[175],"savings":[177],"over":[178],"NVIDIA":[180],"H100":[181],"GPU.":[182]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-05T00:00:00"}