{"id":"https://openalex.org/W4393145543","doi":"https://doi.org/10.1109/asp-dac58780.2024.10473850","title":"Towards Area-Efficient Path-Based In-Memory Computing using Graph Isomorphisms","display_name":"Towards Area-Efficient Path-Based In-Memory Computing using Graph Isomorphisms","publication_year":2024,"publication_date":"2024-01-22","ids":{"openalex":"https://openalex.org/W4393145543","doi":"https://doi.org/10.1109/asp-dac58780.2024.10473850"},"language":"en","primary_location":{"id":"doi:10.1109/asp-dac58780.2024.10473850","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asp-dac58780.2024.10473850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5016081779","display_name":"Sven Thijssen","orcid":"https://orcid.org/0000-0001-8522-4617"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sven Thijssen","raw_affiliation_strings":["University of Central Florida,Department of Computer Science,Orlando,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Central Florida,Department of Computer Science,Orlando,USA","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013959644","display_name":"Muhammad Rashedul Haq Rashed","orcid":"https://orcid.org/0000-0003-0450-695X"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muhammad Rashedul Haq Rashed","raw_affiliation_strings":["University of Central Florida,Department of Electrical and Computer Engineering,Orlando,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Central Florida,Department of Electrical and Computer Engineering,Orlando,USA","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091132511","display_name":"Hao Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hao Zheng","raw_affiliation_strings":["University of Central Florida,Department of Computer Science,Orlando,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Central Florida,Department of Computer Science,Orlando,USA","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075978538","display_name":"Sumit Kumar Jha","orcid":"https://orcid.org/0000-0003-0354-2940"},"institutions":[{"id":"https://openalex.org/I19700959","display_name":"Florida International University","ror":"https://ror.org/02gz6gg07","country_code":"US","type":"education","lineage":["https://openalex.org/I19700959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sumit Kumar Jha","raw_affiliation_strings":["Florida International University,Computer Science Department,Miami,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Florida International University,Computer Science Department,Miami,USA","institution_ids":["https://openalex.org/I19700959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014892277","display_name":"Rickard Ewetz","orcid":"https://orcid.org/0000-0002-4183-6926"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rickard Ewetz","raw_affiliation_strings":["University of Central Florida,Department of Electrical and Computer Engineering,Orlando,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Central Florida,Department of Electrical and Computer Engineering,Orlando,USA","institution_ids":["https://openalex.org/I106165777"]}]}],"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":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"812","last_page":"817"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9842000007629395,"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/T12029","display_name":"DNA and Biological Computing","score":0.9822999835014343,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7354822754859924},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.524747371673584},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4987485408782959},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4756214916706085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4590202569961548},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4259836673736572},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3612831234931946},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1762755811214447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14338117837905884},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0658605694770813}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7354822754859924},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.524747371673584},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4987485408782959},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4756214916706085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4590202569961548},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4259836673736572},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3612831234931946},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1762755811214447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14338117837905884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0658605694770813}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/asp-dac58780.2024.10473850","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asp-dac58780.2024.10473850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC)","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":15,"referenced_works":["https://openalex.org/W2074865640","https://openalex.org/W2081729575","https://openalex.org/W2105715355","https://openalex.org/W2142498761","https://openalex.org/W2172307690","https://openalex.org/W2518281301","https://openalex.org/W2725159389","https://openalex.org/W2889210320","https://openalex.org/W3110943517","https://openalex.org/W3141776272","https://openalex.org/W3186765561","https://openalex.org/W3211445324","https://openalex.org/W4200568566","https://openalex.org/W4293023347","https://openalex.org/W6681029592"],"related_works":["https://openalex.org/W2115140794","https://openalex.org/W2041120224","https://openalex.org/W1504320321","https://openalex.org/W2067902980","https://openalex.org/W4312275919","https://openalex.org/W4385627933","https://openalex.org/W2532801570","https://openalex.org/W2480127678","https://openalex.org/W2806270048","https://openalex.org/W4310605282"],"abstract_inverted_index":{"In-memory":[0],"computing":[1,21,27,48,68,95],"has":[2],"attracted":[3],"significant":[4],"attention":[5],"due":[6],"to":[7,10,44,104,146],"its":[8],"potential":[9],"alleviate":[11],"the":[12,16,71,82,90,120,148,159,183],"issues":[13],"caused":[14],"by":[15,128,177],"von":[17],"Neumann":[18],"bottleneck.":[19],"Path-based":[20],"is":[22,99,126],"a":[23,85,138],"recently":[24],"proposed":[25,155,169],"in-memory":[26,105],"paradigm":[28],"for":[29,88,190],"evaluating":[30],"Boolean":[31],"functions":[32],"using":[33,107,132],"nanoscale":[34],"crossbars.":[35],"Unlike":[36],"state-of-the-art":[37,188],"paradigms":[38],"that":[39,118,167],"use":[40],"expensive":[41],"WRITE":[42],"operations":[43],"execute":[45],"functions,":[46],"path-based":[47,67,94,191],"only":[49],"relies":[50],"on":[51,101,158,182],"READ":[52],"operations,":[53],"which":[54],"translates":[55],"into":[56],"benefits":[57],"of":[58,73,93,140],"low":[59,63],"power":[60],"consumption":[61],"and":[62,143,175,180],"computational":[64,122],"delay.":[65],"Unfortunately,":[66],"comes":[69],"with":[70,186],"penalty":[72],"substantial":[74],"area":[75,91,176],"overhead.":[76],"In":[77],"this":[78],"paper,":[79],"we":[80],"introduce":[81],"ISO":[83,156],"framework,":[84],"hardware-software":[86],"solution":[87],"minimizing":[89],"overhead":[92],"systems.":[96],"The":[97,112,124],"framework":[98,157],"based":[100],"mapping":[102],"computation":[103],"kernels":[106],"an":[108],"intermediate":[109],"k-LUT":[110],"representation.":[111],"k-LUTs":[113],"facilitate":[114,147],"reusing":[115],"hardware":[116,149],"resources":[117],"realize":[119],"same":[121],"structures.":[123],"reuse":[125],"performed":[127],"detecting":[129],"identical":[130],"subfunctions":[131],"isomorphic":[133],"graphs.":[134],"We":[135,151],"also":[136],"present":[137],"set":[139],"program":[141],"instruction":[142],"scheduling":[144],"algorithms":[145],"reuse.":[150],"have":[152],"evaluated":[153],"our":[154,168],"10":[160],"ISCAS85":[161],"benchmarks.":[162],"Our":[163],"experimental":[164],"evaluation":[165],"indicates":[166],"architecture":[170],"improves":[171],"energy":[172],"consumption,":[173],"latency,":[174],"$1.30\\times,":[178],"76.59\\times$,":[179],"$2.79\\times$":[181],"average":[184],"compared":[185],"previous":[187],"methods":[189],"computing.":[192]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}