{"id":"https://openalex.org/W7154973583","doi":"https://doi.org/10.48550/arxiv.2604.15361","title":"GEN-Graph: Heterogeneous PIM Accelerator for General Computational Patterns in Graph-based Dynamic Programming","display_name":"GEN-Graph: Heterogeneous PIM Accelerator for General Computational Patterns in Graph-based Dynamic Programming","publication_year":2026,"publication_date":"2026-04-13","ids":{"openalex":"https://openalex.org/W7154973583","doi":"https://doi.org/10.48550/arxiv.2604.15361"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.15361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.15361","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134059270","display_name":"Yanru Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Yanru","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030074287","display_name":"Runyang Tian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tian, Runyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134006469","display_name":"Zheyu Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Zheyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018911121","display_name":"Mahbod Afarin","orcid":"https://orcid.org/0000-0001-9999-2529"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Afarin, Mahbod","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134033326","display_name":"Weihong Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Weihong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134089025","display_name":"Tajana Rosing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rosing, Tajana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.30250000953674316,"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.30250000953674316,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.10429999977350235,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.10170000046491623,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6675999760627747},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6283000111579895},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5695000290870667},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5231999754905701},{"id":"https://openalex.org/keywords/tile","display_name":"Tile","score":0.5214999914169312},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46230000257492065},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42669999599456787},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.4074999988079071},{"id":"https://openalex.org/keywords/efficient-energy-use","display_name":"Efficient energy use","score":0.3817000091075897},{"id":"https://openalex.org/keywords/hardware-acceleration","display_name":"Hardware acceleration","score":0.36880001425743103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7883999943733215},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6675999760627747},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6302000284194946},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6283000111579895},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5695000290870667},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5231999754905701},{"id":"https://openalex.org/C2780728851","wikidata":"https://www.wikidata.org/wiki/Q468402","display_name":"Tile","level":2,"score":0.5214999914169312},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46230000257492065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4357999861240387},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42669999599456787},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C2742236","wikidata":"https://www.wikidata.org/wiki/Q924713","display_name":"Efficient energy use","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3799000084400177},{"id":"https://openalex.org/C13164978","wikidata":"https://www.wikidata.org/wiki/Q600158","display_name":"Hardware acceleration","level":3,"score":0.36880001425743103},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.34880000352859497},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.34860000014305115},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.33399999141693115},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.3206999897956848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3176000118255615},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.29820001125335693},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C2776245389","wikidata":"https://www.wikidata.org/wiki/Q962139","display_name":"Programming style","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.25839999318122864}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.15361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.15361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8832241892814636,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"While":[0],"graph-based":[1],"dynamic":[2],"programming":[3],"(DP)":[4],"is":[5,15],"a":[6,54,68,82,86,102],"cornerstone":[7],"of":[8,40,77],"genomics":[9],"and":[10,47,100,122,139,161],"network":[11,27],"analytics,":[12,28],"its":[13],"efficiency":[14,142],"hampered":[16],"by":[17,169,186],"fundamentally":[18],"conflicting":[19],"computational":[20],"patterns.":[21],"Matrix-centric":[22],"DP":[23,31,41,109,184],"drives":[24],"regular,":[25],"compute-bound":[26],"while":[29],"topology-centric":[30],"handles":[32],"irregular,":[33],"memory-bound":[34],"genomic":[35],"traversals.":[36],"These":[37],"two":[38,75],"categories":[39],"have":[42],"substantially":[43],"different":[44],"computation":[45],"patterns":[46],"dataflows,":[48],"which":[49],"makes":[50],"it":[51],"difficult":[52],"for":[53,91,107,148,182],"single":[55],"homogeneous":[56],"processing-in-memory":[57],"(PIM)":[58],"architecture":[59],"to":[60,127,171,190],"efficiently":[61],"support":[62],"both.":[63],"This":[64],"work":[65],"presents":[66],"GEN-Graph,":[67],"novel":[69],"heterogeneous":[70],"PIM":[71],"chiplet":[72],"that":[73],"integrates":[74],"types":[76],"specialized":[78],"compute":[79],"tiles":[80],"within":[81],"2.5D":[83],"package:":[84],"Matrix-tile,":[85],"processing-using-memory":[87],"(PUM)":[88],"tile":[89,105,135,155],"optimized":[90,106],"matrix-centric":[92],"workloads,":[93,110],"such":[94,111],"as":[95,112],"all-pairs":[96],"shortest":[97],"path":[98],"(APSP);":[99],"traversal-tile,":[101],"processing-near-memory":[103],"(PNM)":[104],"traversal-centric":[108],"DNA":[113],"sequence":[114],"alignment.":[115],"Our":[116],"hardware-software":[117],"co-design":[118],"employs":[119],"recursive":[120],"partitioning":[121],"reconfigurable":[123],"windowed":[124],"bit-parallel":[125],"logic":[126],"ensure":[128],"exact":[129,180],"computation.":[130],"Results":[131],"show":[132],"the":[133,144,153,177],"matrix":[134],"achieves":[136],"42.8x":[137],"speedup":[138],"392x":[140],"energy":[141],"over":[143],"NVIDIA":[145],"H100":[146],"GPU":[147],"APSP.":[149],"For":[150],"sequence-to-graph":[151],"alignment,":[152],"traversal":[154],"sustains":[156],"2.56":[157],"million":[158],"reads/s":[159,164],"(short-reads)":[160],"39.3":[162],"thousand":[163],"(long-reads),":[165],"outperforming":[166],"state-of-the-art":[167],"accelerators":[168],"up":[170],"2.56x":[172],"in":[173],"throughput.":[174],"GEN-Graph":[175],"provides":[176],"first":[178],"scalable,":[179],"solution":[181],"general":[183],"dataflows":[185],"matching":[187],"hardware":[188],"specialization":[189],"algorithmic":[191],"structure.":[192]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-21T00:00:00"}