{"id":"https://openalex.org/W4312121000","doi":"https://doi.org/10.1145/3508352.3549458","title":"Towards High-Quality CGRA Mapping with Graph Neural Networks and Reinforcement Learning","display_name":"Towards High-Quality CGRA Mapping with Graph Neural Networks and Reinforcement Learning","publication_year":2022,"publication_date":"2022-10-30","ids":{"openalex":"https://openalex.org/W4312121000","doi":"https://doi.org/10.1145/3508352.3549458"},"language":"en","primary_location":{"id":"doi:10.1145/3508352.3549458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3508352.3549458","pdf_url":null,"source":{"id":"https://openalex.org/S4363608844","display_name":"Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design","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/A5023411822","display_name":"Yan Zhuang","orcid":null},"institutions":[{"id":"https://openalex.org/I158842170","display_name":"Chongqing University","ror":"https://ror.org/023rhb549","country_code":"CN","type":"education","lineage":["https://openalex.org/I158842170"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Zhuang","raw_affiliation_strings":["Chongqing University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chongqing University","institution_ids":["https://openalex.org/I158842170"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100361532","display_name":"Zhihao Zhang","orcid":"https://orcid.org/0000-0002-3038-3415"},"institutions":[{"id":"https://openalex.org/I158842170","display_name":"Chongqing University","ror":"https://ror.org/023rhb549","country_code":"CN","type":"education","lineage":["https://openalex.org/I158842170"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhihao Zhang","raw_affiliation_strings":["Chongqing University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chongqing University","institution_ids":["https://openalex.org/I158842170"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102986560","display_name":"Dajiang Liu","orcid":"https://orcid.org/0000-0002-1591-0635"},"institutions":[{"id":"https://openalex.org/I158842170","display_name":"Chongqing University","ror":"https://ror.org/023rhb549","country_code":"CN","type":"education","lineage":["https://openalex.org/I158842170"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dajiang Liu","raw_affiliation_strings":["Chongqing University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chongqing University","institution_ids":["https://openalex.org/I158842170"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I158842170"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9968000054359436,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9965000152587891,"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/computer-science","display_name":"Computer science","score":0.8109661936759949},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7000035643577576},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5849224328994751},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5419304370880127},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4438228905200958},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.432953804731369},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4128768742084503},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4125879406929016},{"id":"https://openalex.org/keywords/reconfigurability","display_name":"Reconfigurability","score":0.41033118963241577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3655608892440796},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36067837476730347},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3187340199947357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13510632514953613},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.13347697257995605}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8109661936759949},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7000035643577576},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5849224328994751},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5419304370880127},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4438228905200958},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.432953804731369},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4128768742084503},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4125879406929016},{"id":"https://openalex.org/C2780149590","wikidata":"https://www.wikidata.org/wiki/Q7302742","display_name":"Reconfigurability","level":2,"score":0.41033118963241577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3655608892440796},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36067837476730347},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3187340199947357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13510632514953613},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.13347697257995605},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3508352.3549458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3508352.3549458","pdf_url":null,"source":{"id":"https://openalex.org/S4363608844","display_name":"Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design","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":14,"referenced_works":["https://openalex.org/W1964191474","https://openalex.org/W1975970429","https://openalex.org/W2023027709","https://openalex.org/W2098908185","https://openalex.org/W2121863487","https://openalex.org/W2338617962","https://openalex.org/W2546571074","https://openalex.org/W2626211758","https://openalex.org/W2766447205","https://openalex.org/W2808787892","https://openalex.org/W2907492528","https://openalex.org/W3018677999","https://openalex.org/W3092349672","https://openalex.org/W4280526971"],"related_works":["https://openalex.org/W2152033542","https://openalex.org/W3074294383","https://openalex.org/W2160425906","https://openalex.org/W1882733036","https://openalex.org/W2546696010","https://openalex.org/W1992741870","https://openalex.org/W2115788285","https://openalex.org/W2055697027","https://openalex.org/W2964181671","https://openalex.org/W2540687752"],"abstract_inverted_index":{"Coarse-Grained":[0],"Reconfigurable":[1],"Architectures":[2],"(CGRA)":[3],"is":[4,35,50,129],"a":[5,65,110,116,148,159,178,183],"promising":[6],"solution":[7,181],"to":[8,13,38,108,146,176,201],"accelerate":[9],"domain":[10],"applications":[11],"due":[12],"its":[14],"good":[15],"combination":[16],"of":[17,25,57,74,124,173],"energy-efficiency":[18],"and":[19,32,102,190],"flexibility.":[20],"Loops,":[21],"as":[22,165,199],"computation-intensive":[23],"parts":[24],"applications,":[26],"are":[27],"often":[28],"mapped":[29],"onto":[30],"CGRA":[31],"modulo":[33,48],"scheduling":[34,49],"commonly":[36],"used":[37],"improve":[39],"the":[40,44,54,58,95,99,121,125,136,162,166,171,202],"execution":[41],"performance.":[42],"However,":[43],"actual":[45],"performance":[46],"using":[47],"highly":[51],"dependent":[52],"on":[53],"mapping":[55,78,88,100,127,180,197],"ability":[56],"Data":[59],"Dependency":[60],"Graph":[61],"(DDG)":[62],"extracted":[63],"from":[64,77,86],"loop.":[66],"As":[67],"existing":[68],"approaches":[69],"usually":[70],"separate":[71],"routing":[72,96,163],"exploration":[73],"multi-cycle":[75],"dependence":[76],"for":[79,155],"fast":[80],"compilation,":[81],"they":[82],"may":[83],"easily":[84],"suffer":[85],"poor":[87],"quality.":[89],"In":[90],"this":[91],"paper,":[92],"we":[93,138,169],"integrate":[94],"explorations":[97],"into":[98],"process":[101],"make":[103],"it":[104],"have":[105],"more":[106],"opportunities":[107],"find":[109,177],"globally":[111],"optimized":[112],"solution.":[113],"Meanwhile,":[114],"with":[115,182],"reduced":[117],"resource":[118,153],"graph":[119,140],"defined,":[120],"searching":[122],"space":[123],"new":[126],"problem":[128],"not":[130],"greatly":[131],"increased.":[132],"To":[133],"efficiently":[134],"solve":[135],"problem,":[137],"introduce":[139],"neural":[141,174],"network":[142,175],"based":[143],"reinforcement":[144],"learning":[145],"predict":[147],"placement":[149],"distribution":[150],"over":[151],"different":[152],"nodes":[154],"all":[156],"operations":[157],"in":[158],"DDG.":[160],"Using":[161],"connectivity":[164],"reward":[167],"signal,":[168],"optimize":[170],"parameters":[172],"valid":[179],"policy":[184],"gradient":[185],"method.":[186],"Without":[187],"much":[188],"engineering":[189],"heuristic":[191],"designing,":[192],"our":[193],"approach":[194],"achieves":[195],"1.57\u00d7":[196],"quality,":[198],"compared":[200],"state-of-the-art":[203],"heuristic.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}