{"id":"https://openalex.org/W4401362386","doi":"https://doi.org/10.1109/mocast61810.2024.10615463","title":"A Graph Neural Network Approach to Improve List Scheduling Heuristics Under Register-Pressure","display_name":"A Graph Neural Network Approach to Improve List Scheduling Heuristics Under Register-Pressure","publication_year":2024,"publication_date":"2024-06-26","ids":{"openalex":"https://openalex.org/W4401362386","doi":"https://doi.org/10.1109/mocast61810.2024.10615463"},"language":"en","primary_location":{"id":"doi:10.1109/mocast61810.2024.10615463","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mocast61810.2024.10615463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 13th International Conference on Modern Circuits and Systems Technologies (MOCAST)","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/A5106333041","display_name":"Fabian Stuckmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fabian Stuckmann","raw_affiliation_strings":["Technische Universität,Chair for Chip Design for Embedded Computing,Braunschweig,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität,Chair for Chip Design for Embedded Computing,Braunschweig,Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038123706","display_name":"Guillermo Pay\u00e1\u2013Vay\u00e1","orcid":"https://orcid.org/0000-0003-3503-8386"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guillermo Pay\u00e1\u2013Vay\u00e1","raw_affiliation_strings":["Technische Universität,Chair for Chip Design for Embedded Computing,Braunschweig,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität,Chair for Chip Design for Embedded Computing,Braunschweig,Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6103,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71453356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"01","last_page":"06"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T14011","display_name":"Elevator Systems and Control","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12288","display_name":"Optimization and Search Problems","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7831755876541138},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7164450883865356},{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.5490980744361877},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5047425031661987},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4363902807235718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35506659746170044},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19291386008262634},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15638241171836853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1290014088153839},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1286768913269043}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7831755876541138},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7164450883865356},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.5490980744361877},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5047425031661987},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4363902807235718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35506659746170044},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19291386008262634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15638241171836853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1290014088153839},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1286768913269043},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mocast61810.2024.10615463","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mocast61810.2024.10615463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 13th International Conference on Modern Circuits and Systems Technologies (MOCAST)","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/W1522301498","https://openalex.org/W2054211050","https://openalex.org/W2113805199","https://openalex.org/W2798300140","https://openalex.org/W2916770803","https://openalex.org/W2994257245","https://openalex.org/W3087838380","https://openalex.org/W4210408109","https://openalex.org/W4231529766","https://openalex.org/W4254263038","https://openalex.org/W4294558607","https://openalex.org/W4308759077","https://openalex.org/W4391222297","https://openalex.org/W6677014272","https://openalex.org/W6773028998"],"related_works":["https://openalex.org/W4297672591","https://openalex.org/W4390073573","https://openalex.org/W2155935413","https://openalex.org/W2755854447","https://openalex.org/W2282591083","https://openalex.org/W2035414676","https://openalex.org/W2070566991","https://openalex.org/W2065941861","https://openalex.org/W1482641086","https://openalex.org/W2018511057"],"abstract_inverted_index":{"Code":[0],"generation":[1],"(for":[2],"VLIW":[3],"processor":[4],"architectures)":[5],"consists":[6],"of":[7,39,49,79,152,172],"instruction":[8,14,104,181],"scheduling":[9,18,25,130,182],"and":[10,60,106,183],"register":[11,55,72,96,134,184],"allocation.":[12,73],"For":[13],"scheduling,":[15,105],"a":[16,77,89,116],"list":[17,24,129],"heuristic":[19,131],"is":[20,45,143,163],"often":[21],"used.":[22],"However,":[23],"heuristics":[26],"do":[27],"not":[28,153],"consider":[29],"registerfile":[30],"constraints,":[31],"such":[32],"as":[33],"register-pressure.":[34],"Thus,":[35],"if":[36],"the":[37,80,84,100,103,107,139,150,159,173],"number":[38,151],"alive":[40],"variables":[41],"(i.e.,":[42,53,58],"virtual":[43],"registers)":[44],"higher":[46],"than":[47],"that":[48,94],"available":[50],"physical":[51,69],"registers":[52,70],"register-pressure),":[54],"spilling":[56,97,135],"instructions":[57],"store":[59],"load":[61],"instructions)":[62],"must":[63],"be":[64],"introduced":[65],"to":[66,76,136,145,156,165,169,177],"free":[67],"up":[68,168],"during":[71,102],"This":[74,86],"leads":[75],"reduction":[78],"code":[81],"compaction,":[82],"decreasing":[83],"performance.":[85],"paper":[87],"introduces":[88],"Graph":[90],"Neural":[91],"Network":[92],"(GNN),":[93],"prevents":[95],"by":[98],"reducing":[99,149],"registerpressure":[101],"required":[108],"Reinforcement":[109],"Learning":[110],"(RL)":[111],"environment":[112],"for":[113],"training.":[114],"Across":[115],"test-suite":[117],"including":[118],"118":[119],"random":[120],"assembly":[121,174],"programs,":[122,148,175],"where":[123],"22":[124],"(18.6%)":[125],"cannot":[126],"schedule":[127,146,167],"using":[128,133],"without":[132],"alleviate":[137],"register-pressure,":[138],"proposed":[140,160],"GNN":[141,161],"approach":[142],"able":[144,164],"117":[147],"schedulable":[154],"programs":[155],"0.8%.":[157],"Moreover,":[158],"scheduler":[162],"optimally":[166],"115":[170],"(97.5%)":[171],"compared":[176],"an":[178],"evolutionarybased":[179],"combined":[180],"allocation":[185],"approach.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}