{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T20:24:37Z","timestamp":1773001477646,"version":"3.50.1"},"reference-count":42,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"content-version":"vor","delay-in-days":309,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62504065"],"award-info":[{"award-number":["62504065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62464005"],"award-info":[{"award-number":["62464005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hainan Province","doi-asserted-by":"publisher","award":["625QN267"],"award-info":[{"award-number":["625QN267"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>Heterogeneous multicore processor systems are commonly used for scheduling tasks of DAG applications. Deep reinforcement learning, with its superior ability to perceive decisions directly and handle high\u2010dimensional state actions, has become a prevalent solution for scheduling these systems. However, the incomplete environment models and large action spaces of deep reinforcement learning present significant challenges to scheduling. This paper investigates a scheduling problem in a heterogeneous multicore processor environment. Initially, system environment information is extracted and encoded using a graph convolutional neural network based on integrating adapter and AdapterFusion into the transformer architecture. Then, by separating task selection and processor allocation, the decision space is reduced: the former uses a deep neural network to learn to select nodes, and the latter allocates processors using a heuristic scheduling algorithm combining earliest completion time\u2010based node replication and rolling technology. The entire scheduling process is a Markov decision problem. Therefore, the PPO algorithm with dynamic adjustment of the clipping factor, combined with an advantage actor\u2010critic network, is employed for training, optimizing, and evaluating the algorithm to find the optimal scheduling strategy. The training process adopts a reward function for the time and power consumption required for completed task scheduling to ensure that multiple DAG application task scheduling can achieve optimal performance. Experiments conducted in various environments with different parameters show that, compared to other algorithms, this algorithm reduces the overall execution time and power consumption cost of heterogeneous multicore processor tasks by 11.09%.<\/jats:p>","DOI":"10.1155\/int\/7562400","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:57:02Z","timestamp":1762433822000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Task Scheduling for Heterogeneous Multi\u2010Core Processors Based on Deep Reinforcement Learning"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0023-8755","authenticated-orcid":false,"given":"Qiguang","family":"Tan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9603-9203","authenticated-orcid":false,"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Dake","family":"Liu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"e_1_2_12_1_2","volume-title":"Robot World Cup","author":"Serrano S. A.","year":"2021"},{"key":"e_1_2_12_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/tr.2020.2981419"},{"key":"e_1_2_12_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2023.102938"},{"key":"e_1_2_12_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109707"},{"key":"e_1_2_12_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-023-08425-0"},{"key":"e_1_2_12_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105345"},{"key":"e_1_2_12_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10247-9"},{"key":"e_1_2_12_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3037965"},{"key":"e_1_2_12_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107351"},{"key":"e_1_2_12_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2956759"},{"key":"e_1_2_12_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2021.3071269"},{"key":"e_1_2_12_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2020.2978386"},{"key":"e_1_2_12_13_2","first-page":"1","article-title":"A Review on New Multilevel Scheduling Algorithm and SJF and Priority Scheduling Algorithms","volume":"11","author":"Khan I.","year":"2023","journal-title":"International Journal of Scientific Research in Network Security and Communication"},{"key":"e_1_2_12_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2802"},{"key":"e_1_2_12_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2022.104685"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2021.102353"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2946216"},{"key":"e_1_2_12_18_2","volume-title":"Gophormer: Ego-Graph Transformer for Node Classification","author":"Zhao J.","year":"2021"},{"key":"e_1_2_12_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2023.04.020"},{"key":"e_1_2_12_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2024.3442997"},{"key":"e_1_2_12_21_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13677-023-00490-y"},{"key":"e_1_2_12_22_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0069-y"},{"key":"e_1_2_12_23_2","article-title":"Transformer for Graphs: An Overview From Architecture Perspective","author":"Min E.","year":"2022","journal-title":"arXiv preprint arXiv:2202.08455"},{"key":"e_1_2_12_24_2","volume-title":"Adapterfusion: Non-Destructive Task Composition for Transfer Learning","author":"Pfeiffer J.","year":"2020"},{"key":"e_1_2_12_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"e_1_2_12_26_2","doi-asserted-by":"crossref","unstructured":"GuptaI. KumarM. S. andJanaP. K. Task Duplication-based Workflow Scheduling for Heterogeneous Cloud Environment 2016 Ninth International Conference on Contemporary Computing August 2016 1\u20137 https:\/\/doi.org\/10.1109\/ic3.2016.7880207 2-s2.0-85018512765.","DOI":"10.1109\/IC3.2016.7880207"},{"key":"e_1_2_12_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2015.07.001"},{"key":"e_1_2_12_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-824054-0.00026-5"},{"key":"e_1_2_12_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-020-09422-4"},{"key":"e_1_2_12_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2021.3070203"},{"key":"e_1_2_12_31_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9091363"},{"key":"e_1_2_12_32_2","unstructured":"HuangS. KanervistoA. RaffinA. WangW. Onta\u00f1\u00f3nS. andDossaR. F. J. A2C is a Special Case of PPO 2022."},{"key":"e_1_2_12_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2022.3197298"},{"key":"e_1_2_12_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.07.111"},{"key":"e_1_2_12_35_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1757\/1\/012156"},{"key":"e_1_2_12_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/SACI51354.2021.9465602"},{"key":"e_1_2_12_37_2","first-page":"24611","article-title":"The Surprising Effectiveness of Ppo in Cooperative Multi-Agent Games","volume":"35","author":"Yu C.","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_12_38_2","unstructured":"TPC TPC-h Benchmark Vesion 2 and Version 3 2022 2022."},{"key":"e_1_2_12_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04118-8"},{"key":"e_1_2_12_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103501"},{"key":"e_1_2_12_41_2","doi-asserted-by":"crossref","unstructured":"ZhuY.andHuB. Smart-mDAG: An Intelligent Scheduling Method for multi-DAG Jobs 2021 International Conference on Information and Communication Technology Convergence (ICTC) October 2021 IEEE 110\u2013115 https:\/\/doi.org\/10.1109\/ictc52510.2021.9621176.","DOI":"10.1109\/ICTC52510.2021.9621176"},{"key":"e_1_2_12_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-16008-2"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/7562400","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/int\/7562400","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/7562400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T18:01:01Z","timestamp":1772992861000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/int\/7562400"}},"subtitle":[],"editor":[{"given":"Richard","family":"Murray","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/int\/7562400"],"URL":"https:\/\/doi.org\/10.1155\/int\/7562400","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-09-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7562400"}}