A Dynamic Prioritization-based Collaborative Task Scheduling Algorithm for Cloud-side-end of Distribution Networks
Affected by resource configuration and task request characteristics, the rationality of distribution network task scheduling is directly related to its operating status. For this reason, a research on cloud-edge collaborative task scheduling algorithm for distribution network based on dynamic priority is proposed. On the basis of using a unified semantic data model to solve the problem of information interaction obstacles, through information modeling, a consistent model framework is provided for core information such as terminal device identification and operating status; after taking into account the inherent static priority of the task (reflecting the basic importance of tasks), it incorporates the consideration of the task’s tolerance of deadlines, completes the dynamic priority division of tasks, and efficiently utilizes the limited computing resources of the object layer in the model while meeting the timeliness requirements of each task as much as possible. principles to perform task scheduling. In the test results, the load deviation is basically stable within 0.15, with the maximum value only 0.16; the ratio of cost to output is always lower than 0.84. Compared with the control group, it has significant advantages in stability and balance respectively.
Authors
- Yunhua Liu (ORCID: https://orcid.org/0000-0003-4693-2391)
- Yuxuan Yang (ORCID: https://orcid.org/0009-0004-0906-7292)
- Hua Li (ORCID: https://orcid.org/0000-0002-9898-4233)
- Furong Yin
- Z. Y. Wu (ORCID: https://orcid.org/0000-0003-1565-0324)
Institutions
- China Southern Power Grid (China) (CN)
Publication Details
- Published
- 2024-12-13
- DOI
- https://doi.org/10.1109/sgei63936.2024.10914331
- Primary Topic
- Distributed and Parallel Computing Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00