The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths
Abstract The task scheduling problem based on directed acyclic graphs (DAGs) has been proven to be NP-complete in general cases or under certain restrictions. In this paper, building upon existing scheduling algorithms, we introduce a static task scheduling algorithm based on directed acyclic graphs...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-04-01
|
| Series: | Energy Informatics |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s42162-025-00516-6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850284661700296704 |
|---|---|
| author | Qi Guo Yuanhong Lu Jie Zhang Jingyue Zhang Libin Huang Haiping Guo Tianyu Guo Liang Tu |
| author_facet | Qi Guo Yuanhong Lu Jie Zhang Jingyue Zhang Libin Huang Haiping Guo Tianyu Guo Liang Tu |
| author_sort | Qi Guo |
| collection | DOAJ |
| description | Abstract The task scheduling problem based on directed acyclic graphs (DAGs) has been proven to be NP-complete in general cases or under certain restrictions. In this paper, building upon existing scheduling algorithms, we introduce a static task scheduling algorithm based on directed acyclic graphs. By incorporating the proportion of task transmission delay as a guiding metric in the optimization process, processors can be prioritized for tasks with high latency, thereby improving computational efficiency. We first validate the theoretical feasibility of the algorithm using a theoretical case study and illustrate the algorithmic effectiveness using two real case studies, direct current (DC) model and alternating current (AC) model respectively. The research indicates that the scheduling algorithm proposed in this paper achieves an average scheduling length improvement of over 1.2% compared to the Heterogeneous Earliest-Finish-Time algorithm (HEFT) in topologies with high latency tasks. Additionally, the experiments show that the HEFT algorithm consumes 39.85us and the EMT-DM algorithm consumes 38.29us during simulation using DC, and the HEFT algorithm consumes 31.23us and the EMT-DM algorithm consumes 26.51us during simulation using AC, both of which are improved compared to the HEFT algorithm. |
| format | Article |
| id | doaj-art-86d85ef2b4964329a2efb7e04737a039 |
| institution | OA Journals |
| issn | 2520-8942 |
| language | English |
| publishDate | 2025-04-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Energy Informatics |
| spelling | doaj-art-86d85ef2b4964329a2efb7e04737a0392025-08-20T01:47:30ZengSpringerOpenEnergy Informatics2520-89422025-04-018111210.1186/s42162-025-00516-6The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical pathsQi Guo0Yuanhong Lu1Jie Zhang2Jingyue Zhang3Libin Huang4Haiping Guo5Tianyu Guo6Liang Tu7State Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridState Key Laboratory of HVDC, Electric Power Research Institute, China Southern Power GridAbstract The task scheduling problem based on directed acyclic graphs (DAGs) has been proven to be NP-complete in general cases or under certain restrictions. In this paper, building upon existing scheduling algorithms, we introduce a static task scheduling algorithm based on directed acyclic graphs. By incorporating the proportion of task transmission delay as a guiding metric in the optimization process, processors can be prioritized for tasks with high latency, thereby improving computational efficiency. We first validate the theoretical feasibility of the algorithm using a theoretical case study and illustrate the algorithmic effectiveness using two real case studies, direct current (DC) model and alternating current (AC) model respectively. The research indicates that the scheduling algorithm proposed in this paper achieves an average scheduling length improvement of over 1.2% compared to the Heterogeneous Earliest-Finish-Time algorithm (HEFT) in topologies with high latency tasks. Additionally, the experiments show that the HEFT algorithm consumes 39.85us and the EMT-DM algorithm consumes 38.29us during simulation using DC, and the HEFT algorithm consumes 31.23us and the EMT-DM algorithm consumes 26.51us during simulation using AC, both of which are improved compared to the HEFT algorithm.https://doi.org/10.1186/s42162-025-00516-6Directed acyclic graph (DAG)Static task schedulingTransmission delay ratioDirect current (DC) model case study and alternating current (AC) large model case studyTheoretical case study |
| spellingShingle | Qi Guo Yuanhong Lu Jie Zhang Jingyue Zhang Libin Huang Haiping Guo Tianyu Guo Liang Tu The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths Energy Informatics Directed acyclic graph (DAG) Static task scheduling Transmission delay ratio Direct current (DC) model case study and alternating current (AC) large model case study Theoretical case study |
| title | The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths |
| title_full | The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths |
| title_fullStr | The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths |
| title_full_unstemmed | The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths |
| title_short | The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths |
| title_sort | electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths |
| topic | Directed acyclic graph (DAG) Static task scheduling Transmission delay ratio Direct current (DC) model case study and alternating current (AC) large model case study Theoretical case study |
| url | https://doi.org/10.1186/s42162-025-00516-6 |
| work_keys_str_mv | AT qiguo theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT yuanhonglu theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT jiezhang theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT jingyuezhang theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT libinhuang theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT haipingguo theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT tianyuguo theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT liangtu theelectromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT qiguo electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT yuanhonglu electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT jiezhang electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT jingyuezhang electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT libinhuang electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT haipingguo electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT tianyuguo electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths AT liangtu electromagnetictransientsimulationaccelerationalgorithmbasedondelaymitigationofdynamiccriticalpaths |