Research on Distributed Computing Power Scheduling Based on Ant Path Optimization
This study solves the problem of data fusion caused by multi-source and cross-domain power business data, proposes a cross-domain computing capability model for the entire network based on the data middle platform, realizes the sharing and computing of multi-source data, and provides a new solution for the challenges of data centers. It also designs a cross-domain computing power scheduling algorithm based on ant path optimization, significantly improves the accuracy and stability of computing power scheduling through heuristic information design, etc. Experimental verification shows that the algorithm is superior to existing distributed scheduling algorithms in terms of scheduling overhead, etc., and is suitable for the multi-source cross-domain data fusion computing scenarios in data centers. The innovation lies in the introduction of the path optimization idea of the ant algorithm, overcomes the problems of traditional scheduling algorithms, and provides examples and method support for the optimization of power data management and distributed data processing technology in other fields.
Authors
- Guanjun Li
- Wende Wang (ORCID: https://orcid.org/0000-0003-2000-3914)
- Zihan Jin
- Cong Hu (ORCID: https://orcid.org/0009-0000-2286-5337)
- Xiaoqiang Liu (ORCID: https://orcid.org/0000-0002-5244-0695)
- Chao Chen (ORCID: https://orcid.org/0000-0002-5704-3939)
- Shijie Gao
Institutions
- North China Electric Power University (CN)
- State Grid Corporation of China (China) (CN)
- PowerChina (China) (CN)
- Shanghai Electric (China) (CN)
Publication Details
- Published
- 2024-09-13
- DOI
- https://doi.org/10.1109/aiotc63215.2024.10748249
- Citations
- 1
- Primary Topic
- Power Systems and Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.21