{"id":"https://openalex.org/W3120529295","doi":"https://doi.org/10.1109/llvmhpchipar51896.2020.00008","title":"Deep Learning-based Approximate Graph-Coloring Algorithm for Register Allocation","display_name":"Deep Learning-based Approximate Graph-Coloring Algorithm for Register Allocation","publication_year":2020,"publication_date":"2020-11-01","ids":{"openalex":"https://openalex.org/W3120529295","doi":"https://doi.org/10.1109/llvmhpchipar51896.2020.00008","mag":"3120529295"},"language":"en","primary_location":{"id":"doi:10.1109/llvmhpchipar51896.2020.00008","doi":"https://doi.org/10.1109/llvmhpchipar51896.2020.00008","is_oa":false,"landing_page_url":"https://doi.org/10.1109/llvmhpchipar51896.2020.00008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/ACM 6th Workshop on the LLVM Compiler Infrastructure in HPC (LLVM-HPC) and Workshop on Hierarchical Parallelism for Exascale Computing (HiPar)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5058076388","display_name":"Dibyendu Kumar Das","orcid":"https://orcid.org/0000-0002-3328-7883","observed_orcids":["https://orcid.org/0000-0002-3328-7883"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dibyendu Das","raw_affiliation_strings":["AMD, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AMD, Bangalore, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041205564","display_name":"Shahid Asghar Ahmad","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shahid Asghar Ahmad","raw_affiliation_strings":["AMD, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AMD, Bangalore, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046125169","display_name":"Kumar Venkataramanan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkataramanan Kumar","raw_affiliation_strings":["AMD, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AMD, Bangalore, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8167,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.6746258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"32"},"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.31049999594688416,"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.31049999594688416,"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/T10126","display_name":"Logic, programming, and type systems","score":0.14920000731945038,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.05849999934434891,"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/graph-coloring","display_name":"graph coloring","score":0.9620000123977661},{"id":"https://openalex.org/keywords/register-allocation","display_name":"register allocation","score":0.9769999980926514},{"id":"https://openalex.org/keywords/interference-graph","display_name":"interference graph","score":0.9829999804496765},{"id":"https://openalex.org/keywords/lstm","display_name":"LSTM","score":0.41100001335144043},{"id":"https://openalex.org/keywords/color-correction","display_name":"color correction","score":0.6380000114440918},{"id":"https://openalex.org/keywords/heuristic-learning","display_name":"heuristic learning","score":0.574999988079071},{"id":"https://openalex.org/keywords/compiler-optimization","display_name":"compiler optimization","score":0.6029999852180481}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.9019770622253418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7718460559844971},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.6134341955184937},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5909465551376343},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5895419120788574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5459839105606079},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5030526518821716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3679134249687195},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32756033539772034},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.20152610540390015},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19068560004234314},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12891459465026855},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/llvmhpchipar51896.2020.00008","doi":"https://doi.org/10.1109/llvmhpchipar51896.2020.00008","is_oa":false,"landing_page_url":"https://doi.org/10.1109/llvmhpchipar51896.2020.00008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/ACM 6th Workshop on the LLVM Compiler Infrastructure in HPC (LLVM-HPC) and Workshop on Hierarchical Parallelism for Exascale Computing (HiPar)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2007033386","https://openalex.org/W2023200270","https://openalex.org/W2044636417","https://openalex.org/W2046610653","https://openalex.org/W2064675550","https://openalex.org/W2093938881","https://openalex.org/W2116341502","https://openalex.org/W2118866757","https://openalex.org/W2133564696","https://openalex.org/W2167036627","https://openalex.org/W2168000780","https://openalex.org/W2170973209","https://openalex.org/W2324827308","https://openalex.org/W2557283755","https://openalex.org/W2766447205","https://openalex.org/W2786776430","https://openalex.org/W2795827704","https://openalex.org/W2919364174","https://openalex.org/W2963117013","https://openalex.org/W2964308564","https://openalex.org/W3148529197","https://openalex.org/W3152893301"],"related_works":["https://openalex.org/W2992281624","https://openalex.org/W7095226400","https://openalex.org/W7095998008","https://openalex.org/W1547217239","https://openalex.org/W65799340","https://openalex.org/W7099547157","https://openalex.org/W7098009863","https://openalex.org/W4391212349","https://openalex.org/W2160795347","https://openalex.org/W7097225305"],"abstract_inverted_index":{"Graph-coloring":[0],"is":[1,14,32,88,99,143,181],"an":[2,28,130,134,149,257],"NP-hard":[3],"problem":[4],"which":[5,13,65,98,232],"has":[6],"a":[7,15,19,43,108,162,189,192,197,217,235],"myriad":[8],"of":[9,18,33,80,104,113,137,188,191,271,276,301,338],"applications.":[10],"Register":[11],"allocation,":[12],"crucial":[16],"phase":[17,165,205],"good":[20,44],"optimizing":[21],"compiler,":[22],"relies":[23],"on":[24,101,330],"graph":[25],"coloring.":[26,259],"Hence,":[27],"efficient":[29],"graph-coloring":[30],"algorithm":[31,180,194,279,291,309,328],"paramount":[34],"importance.":[35],"In":[36],"this":[37],"work":[38],"we":[39,74,155,287],"try":[40],"to":[41,60,82,91,125,145,151,215,220,227,280,297],"'learn'":[42],"heuristic":[45],"for":[46,110,317,336],"coloring":[47,87,136,211,300],"interference":[48,63,139],"graphs":[49,64,73,249,270,283],"that":[50,106,166,223,251,289,325],"are":[51,224],"used":[52,90],"in":[53,133,148,185,285],"the":[54,77,83,114,117,122,126,138,169,175,207,228,242,298,326],"register":[55,314],"allocation":[56,79],"phase.":[57,201],"We":[58,260,304],"aim":[59],"handle":[61],"moderate-sized":[62],"have":[66,171,261,305],"100":[67],"nodes":[68,127,222],"or":[69,183,332],"less.":[70],"For":[71],"such":[72],"can":[75],"get":[76,256],"optimal":[78,86,299],"colors":[81,170],"nodes.":[84],"Such":[85],"then":[89],"train":[92],"our":[93,157,179,263,277,290,308],"Deep":[94],"Learning":[95],"(DL)":[96],"network":[97,119,160,265],"based":[100],"several":[102,267,318],"layers":[103],"LSTM":[105,150],"output":[107],"color":[109,124,163,203,218,238],"each":[111],"node":[112],"graph.":[115,140],"However,":[116],"trained":[118,262],"may":[120,255],"allocate":[121],"same":[123],"connected":[128,226],"by":[129,174,196,212],"edge":[131],"resulting":[132],"invalid":[135,153,210,229,243,258],"Since":[141],"it":[142,233],"difficult":[144],"encode":[146],"constraints":[147],"avoid":[152],"coloring,":[154],"augment":[156],"deep":[158],"learning":[159],"with":[161,209,247],"correction":[164,200,204],"runs":[167],"after":[168],"been":[172],"allocated":[173,219],"DL":[176,193,264],"network.":[177],"Thus,":[178],"approximate":[182,278,327],"hybrid":[184],"nature":[186],"consisting":[187],"mix":[190],"followed":[195],"more":[198],"traditional":[199],"The":[202],"handles":[206],"edges":[208,254],"first":[213],"trying":[214],"reuse":[216],"other":[221],"not":[225],"nodes,":[230],"failing":[231],"adds":[234],"totally":[236],"new":[237],"-":[239],"thereby":[240],"breaking":[241],"allocation.":[244],"Our":[245],"experience":[246],"many":[248],"shows":[250],"around":[252],"10%-30%":[253],"using":[266],"thousand":[268],"random":[269],"varying":[272],"sparsity(density).":[273],"On":[274],"application":[275],"various":[281],"popular":[282,312],"found":[284],"literature":[286],"see":[288],"does":[292],"very":[293],"well":[294],"when":[295],"compared":[296],"these":[302,339],"graphs.":[303],"also":[306],"run":[307],"against":[310],"LLVM's":[311],"greedy":[313],"allocator":[315],"(GRA)":[316],"SPEC":[319],"CPU":[320],"2017":[321],"benchmarks":[322],"and":[323],"notice":[324],"performs":[329],"par":[331],"better":[333],"than":[334],"GRA":[335],"most":[337],"benchmarks.":[340]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2021-01-18T00:00:00"}