{"id":"https://openalex.org/W7147246368","doi":"https://doi.org/10.1109/cnml68938.2026.11452361","title":"DF-DDQN: Resource-Aware Dual-Flow Scheduling for Multi-Queue DAG Systems","display_name":"DF-DDQN: Resource-Aware Dual-Flow Scheduling for Multi-Queue DAG Systems","publication_year":2026,"publication_date":"2026-01-30","ids":{"openalex":"https://openalex.org/W7147246368","doi":"https://doi.org/10.1109/cnml68938.2026.11452361"},"language":null,"primary_location":{"id":"doi:10.1109/cnml68938.2026.11452361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cnml68938.2026.11452361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 International Conference on Communication Networks and Machine Learning (CNML)","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/A5053526171","display_name":"Zhenkun Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I4210158984","display_name":"National Supercomputing Center in Wuxi","ror":"https://ror.org/04ypjrs34","country_code":"CN","type":"other","lineage":["https://openalex.org/I4210158984"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhenkun Zheng","raw_affiliation_strings":["National Supercomputer Center in Jinan,Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center,Jinan,China"],"affiliations":[{"raw_affiliation_string":"National Supercomputer Center in Jinan,Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center,Jinan,China","institution_ids":["https://openalex.org/I4210158984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132579177","display_name":"Ying Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100302","display_name":"Jinan Foundry and Metalforming Machinery Research Institute (China)","ror":"https://ror.org/00mr5v348","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210100302"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ying Guo","raw_affiliation_strings":["Jinan Institute of Supercomputing Technology,Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science,Jinan,China"],"affiliations":[{"raw_affiliation_string":"Jinan Institute of Supercomputing Technology,Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science,Jinan,China","institution_ids":["https://openalex.org/I4210100302"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132547736","display_name":"Longfei Yue","orcid":null},"institutions":[{"id":"https://openalex.org/I4210158984","display_name":"National Supercomputing Center in Wuxi","ror":"https://ror.org/04ypjrs34","country_code":"CN","type":"other","lineage":["https://openalex.org/I4210158984"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Longfei Yue","raw_affiliation_strings":["National Supercomputer Center in Jinan,Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center,Jinan,China"],"affiliations":[{"raw_affiliation_string":"National Supercomputer Center in Jinan,Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center,Jinan,China","institution_ids":["https://openalex.org/I4210158984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132624060","display_name":"Di Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100302","display_name":"Jinan Foundry and Metalforming Machinery Research Institute (China)","ror":"https://ror.org/00mr5v348","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210100302"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Di Wang","raw_affiliation_strings":["Jinan Institute of Supercomputing Technology,Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science,Jinan,China"],"affiliations":[{"raw_affiliation_string":"Jinan Institute of Supercomputing Technology,Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science,Jinan,China","institution_ids":["https://openalex.org/I4210100302"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5132625342","display_name":"Yuanhe Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210158984","display_name":"National Supercomputing Center in Wuxi","ror":"https://ror.org/04ypjrs34","country_code":"CN","type":"other","lineage":["https://openalex.org/I4210158984"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanhe Liu","raw_affiliation_strings":["National Supercomputer Center in Jinan,Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center,Jinan,China"],"affiliations":[{"raw_affiliation_string":"National Supercomputer Center in Jinan,Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center,Jinan,China","institution_ids":["https://openalex.org/I4210158984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5053526171"],"corresponding_institution_ids":["https://openalex.org/I4210158984"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.89492693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"34","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6754000186920166,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6754000186920166,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.16259999573230743,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.07410000264644623,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5827000141143799},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5715000033378601},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5555999875068665},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4691999852657318},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4544999897480011},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4530999958515167},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4494999945163727},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4325000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.878600001335144},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6833999752998352},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5827000141143799},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5715000033378601},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5555999875068665},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4691999852657318},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4544999897480011},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4530999958515167},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4494999945163727},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3971000015735626},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.37610000371932983},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.3578000068664551},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.33660000562667847},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3301999866962433},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.29820001125335693},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.2793000042438507},{"id":"https://openalex.org/C172430144","wikidata":"https://www.wikidata.org/wiki/Q17111997","display_name":"Symmetric multiprocessor system","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.25609999895095825},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cnml68938.2026.11452361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cnml68938.2026.11452361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 International Conference on Communication Networks and Machine Learning (CNML)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4409254193305969,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2045141560","https://openalex.org/W2070307035","https://openalex.org/W2106076593","https://openalex.org/W2895943233","https://openalex.org/W2903931051","https://openalex.org/W3191169707","https://openalex.org/W3192536512","https://openalex.org/W4296079434","https://openalex.org/W4327808408","https://openalex.org/W4381054366","https://openalex.org/W4386788337","https://openalex.org/W4387643251","https://openalex.org/W4390604606","https://openalex.org/W4391853671","https://openalex.org/W4394730888","https://openalex.org/W4395047770","https://openalex.org/W4402284933","https://openalex.org/W4406689816"],"related_works":[],"abstract_inverted_index":{"With":[0],"the":[1],"rapid":[2],"growth":[3],"of":[4,142],"parallel":[5],"computing":[6,20,206],"and":[7,42,55,84,90,109,136,181,190,202],"data-intensive":[8],"applications,":[9],"DAG-based":[10],"task":[11,57,97,148],"scheduling":[12,26,117,200],"has":[13],"become":[14],"a":[15,76],"critical":[16,100],"challenge":[17],"in":[18,118,188],"modern":[19],"systems.":[21],"In":[22],"heterogeneous,":[23],"high-concurrency":[24],"environments,":[25],"constraints":[27],"extend":[28],"beyond":[29],"computational":[30],"resources":[31],"to":[32,114,130],"include":[33],"storage-related":[34],"factors":[35],"such":[36],"as":[37],"data":[38,85],"locality,":[39],"access":[40],"paths,":[41,101],"bandwidth":[43],"latency.":[44],"Traditional":[45],"heuristic":[46],"methods":[47],"often":[48],"struggle":[49],"with":[50,104,125,167],"dynamic":[51],"workloads,":[52],"resource":[53,134,176],"heterogeneity,":[54],"complex":[56],"dependencies,":[58],"especially":[59],"under":[60],"tightly":[61],"coupled":[62],"computation\u2013data":[63],"flows.":[64],"To":[65],"address":[66],"these":[67],"challenges,":[68],"we":[69],"propose":[70],"DF-DDQN":[71],"(Dual-Flow":[72],"Double":[73],"Deep":[74],"Q-Network),":[75],"deep":[77],"reinforcement":[78],"learning":[79],"framework":[80,94],"that":[81],"decouples":[82],"computation":[83],"flows":[86],"for":[87],"joint":[88],"modeling":[89],"adaptive":[91],"optimization.":[92],"The":[93],"integrates":[95],"structure-aware":[96],"representations":[98],"(e.g.,":[99],"dependency":[102,137],"vectors)":[103],"resource-aware":[105],"state":[106],"features":[107],"(CPU":[108],"memory":[110],"utilization,":[111,135],"queue":[112,193],"loads)":[113],"enable":[115],"efficient":[116],"multi-queue":[119],"environments.":[120],"A":[121],"dual-flow":[122],"simulation":[123],"environment":[124],"multi-objective":[126],"rewards":[127],"is":[128],"designed":[129],"balance":[131],"makespan":[132],"minimization,":[133],"satisfaction.":[138],"Experiments":[139],"on":[140],"DAGs":[141],"various":[143],"sizes":[144],"demonstrate":[145],"strong":[146],"performance:":[147],"duration":[149],"prediction":[150,159],"achieves":[151],"R<sup":[152,161],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[153,162],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[154,163],"=":[155,164],"0.98,":[156],"CPU":[157],"usage":[158,177],"reaches":[160],"0.99;":[165],"workloads":[166],"95":[168],"tasks":[169],"complete":[170],"5%":[171],"faster":[172],"than":[173],"HEFT,":[174],"reduce":[175],"variability":[178],"by":[179,185],"27%,":[180],"lower":[182],"CV/Gini":[183],"coefficients":[184],"25\u201350%,":[186],"resulting":[187],"smoother":[189],"more":[191],"balanced":[192],"utilization.":[194],"These":[195],"results":[196],"confirm":[197],"DF-DDQN\u2019s":[198],"superior":[199],"intelligence":[201],"robustness":[203],"across":[204],"heterogeneous":[205],"scenarios.":[207]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-04-02T00:00:00"}