{"id":"https://openalex.org/W3120676446","doi":"https://doi.org/10.1109/ssci47803.2020.9308278","title":"Geometric deep reinforcement learning for dynamic DAG scheduling","display_name":"Geometric deep reinforcement learning for dynamic DAG scheduling","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3120676446","doi":"https://doi.org/10.1109/ssci47803.2020.9308278","mag":"3120676446"},"language":"en","primary_location":{"id":"doi:10.1109/ssci47803.2020.9308278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci47803.2020.9308278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5032092481","display_name":"Nathan Grinsztajn","orcid":"https://orcid.org/0000-0001-6817-5972"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathan Grinsztajn","raw_affiliation_strings":["UMR 9189 CRIStAL, Univ. Lille, CNRS, Inria, Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMR 9189 CRIStAL, Univ. Lille, CNRS, Inria, Lille, France","institution_ids":["https://openalex.org/I2279609970","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064515122","display_name":"Olivier Beaumont","orcid":"https://orcid.org/0000-0003-2741-6228"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Olivier Beaumont","raw_affiliation_strings":["Hiepacs team, Inria Bordeaux Bordeaux, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hiepacs team, Inria Bordeaux Bordeaux, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005797486","display_name":"Emmanuel Jeannot","orcid":"https://orcid.org/0000-0002-3956-2997"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emmanuel Jeannot","raw_affiliation_strings":["TADaaM team, Inria Bordeaux, Bordeaux, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TADaaM team, Inria Bordeaux, Bordeaux, France","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Philippe Preux","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Preux","raw_affiliation_strings":["UMR 9189 CRIStAL, Univ. Lille, CNRS, Inria, Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMR 9189 CRIStAL, Univ. Lille, CNRS, Inria, Lille, France","institution_ids":["https://openalex.org/I2279609970","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4062,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71430948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9889000058174133,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9776999950408936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8532456159591675},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7899596691131592},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5549858808517456},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5267210006713867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37403321266174316},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35977086424827576},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35166412591934204},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1923743486404419}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8532456159591675},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7899596691131592},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5549858808517456},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5267210006713867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37403321266174316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35977086424827576},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35166412591934204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1923743486404419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci47803.2020.9308278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci47803.2020.9308278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","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":52,"referenced_works":["https://openalex.org/W988231918","https://openalex.org/W1488422606","https://openalex.org/W1501066815","https://openalex.org/W1515851193","https://openalex.org/W1585546214","https://openalex.org/W1771410628","https://openalex.org/W1777753236","https://openalex.org/W1977613901","https://openalex.org/W1993411524","https://openalex.org/W2030167104","https://openalex.org/W2057392949","https://openalex.org/W2087440962","https://openalex.org/W2121893797","https://openalex.org/W2124480634","https://openalex.org/W2277451201","https://openalex.org/W2519887557","https://openalex.org/W2546571074","https://openalex.org/W2607264901","https://openalex.org/W2617411258","https://openalex.org/W2804682296","https://openalex.org/W2891230096","https://openalex.org/W2900896126","https://openalex.org/W2903931051","https://openalex.org/W2918342466","https://openalex.org/W2922429874","https://openalex.org/W2947035277","https://openalex.org/W2949608212","https://openalex.org/W2949869455","https://openalex.org/W2951430899","https://openalex.org/W2963867952","https://openalex.org/W2964015378","https://openalex.org/W2964043796","https://openalex.org/W2977038365","https://openalex.org/W2978633783","https://openalex.org/W2982286017","https://openalex.org/W3083598327","https://openalex.org/W4214717370","https://openalex.org/W4288419263","https://openalex.org/W6625775519","https://openalex.org/W6634919779","https://openalex.org/W6638018090","https://openalex.org/W6692846177","https://openalex.org/W6726873649","https://openalex.org/W6736495275","https://openalex.org/W6738144653","https://openalex.org/W6751627690","https://openalex.org/W6754582438","https://openalex.org/W6760045743","https://openalex.org/W6762750439","https://openalex.org/W6763760226","https://openalex.org/W6768142256","https://openalex.org/W6768695126"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775","https://openalex.org/W2952904874"],"abstract_inverted_index":{"In":[0,57],"practice,":[1],"it":[2,74],"is":[3,30,114,172],"quite":[4],"common":[5],"to":[6,66,75,92,99,156,225],"face":[7],"combinatorial":[8,45],"optimization":[9,46],"problems":[10,47],"which":[11,134],"contain":[12],"uncertainty":[13],"along":[14],"with":[15,32,150,174],"non":[16],"determinism":[17],"and":[18,72,118,131,206,220],"dynamicity.":[19],"These":[20],"three":[21],"properties":[22,214],"call":[23],"for":[24],"appropriate":[25],"algorithms;":[26],"reinforcement":[27,54,63],"learning":[28,55,64],"(RL)":[29],"dealing":[31],"them":[33],"in":[34,80,101,148,178],"a":[35,62,68,102],"very":[36],"natural":[37],"way.":[38],"Today,":[39],"despite":[40],"some":[41],"efforts,":[42],"most":[43],"real-life":[44],"remain":[48],"out":[49],"of":[50,53,108,161,193],"the":[51,81,86,90,106,109,128,162,165,194,208],"reach":[52],"algorithms.":[56],"this":[58,170,217],"paper,":[59],"we":[60,197],"propose":[61],"approach":[65,171],"solve":[67],"realistic":[69],"scheduling":[70],"problem,":[71],"apply":[73],"an":[76,151,158,190],"algorithm":[77,143,154,186],"commonly":[78],"executed":[79],"high":[82,179],"performance":[83,180],"computing":[84,181],"community,":[85],"CHOLESKY":[87],"factorization.":[88],"On":[89],"contrary":[91],"static":[93],"scheduling,":[94],"where":[95],"tasks":[96],"are":[97,122],"assigned":[98],"processors":[100],"predetermined":[103],"ordering":[104,121],"before":[105],"beginning":[107],"parallel":[110],"execution,":[111],"our":[112,142,185],"method":[113],"dynamic:":[115],"task":[116],"allocations":[117],"their":[119],"execution":[120],"decided":[123],"at":[124],"runtime,":[125],"based":[126],"on":[127,164],"system":[129],"state":[130],"unexpected":[132],"events,":[133],"allows":[135],"much":[136],"more":[137],"flexibility.":[138],"To":[139],"do":[140],"so,":[141],"uses":[144],"graph":[145],"neural":[146],"networks":[147],"combination":[149],"actor":[152],"critic":[153],"(A2C)":[155],"build":[157],"adaptive":[159],"representation":[160],"problem":[163],"fly.":[166],"We":[167,210],"show":[168],"that":[169,199],"competitive":[173],"state-of-the-art":[175],"heuristics":[176],"used":[177],"runtime":[182],"systems.":[183],"Moreover,":[184],"does":[187],"not":[188],"require":[189],"explicit":[191],"model":[192],"environment,":[195],"but":[196],"demonstrate":[198],"extra":[200],"knowledge":[201],"can":[202],"easily":[203],"be":[204],"incorporated":[205],"improves":[207],"performance.":[209],"also":[211],"exhibit":[212],"key":[213],"provided":[215],"by":[216],"RL":[218],"approach,":[219],"study":[221],"its":[222],"transfer":[223],"abilities":[224],"other":[226],"instances.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}