Simulation on dynamic load balancing of distributed parallel computing network system

被引:0
作者
Wu, Huawei [1 ,2 ]
Sun, Chuan [3 ,4 ]
Li, Yicheng [5 ]
Kuang, Yong [6 ]
机构
[1] Hubei Univ Arts & Sci, Hubei Key Lab Power Syst Design & Test Elect Vehi, Xiangyang, Hubei, Peoples R China
[2] Hubei Univ Arts & Sci, Sch Automot & Traff Engn, Xiangyang 441053, Hubei, Peoples R China
[3] Huanggang Normal Univ, Sch Mech Elect & Automot Engn, Huanggang 438000, Hubei, Peoples R China
[4] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Hubei, Peoples R China
[5] Jiangsu Univ, Automot Engn Res Inst, Zhenjiang 212013, Jiangsu, Peoples R China
[6] Dongfeng Xiangyang Touring Car Co Ltd, Xiangyang, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
distributed parallel computing network; load; channel; transmission link; balancing scheduling; ALGORITHM;
D O I
10.1504/IJIPT.2021.117411
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In order to improve the dynamic load balancing scheduling capability of distributed parallel computing network system and the throughput performance of network, a dynamic load balancing scheduling algorithm of distributed parallel computing network system is proposed. In this algorithm, a channel transmission model for task scheduling of distributed parallel computing network is constructed. The adaptive link equalisation method is adopted to perform balanced design of distributed parallel computing network transmission channel. The fractional interval interpolation method is adopted to construct the priority list decision function for dynamic load scheduling in balanced transmission channel. Based on the decision function, the balancing scheduling threshold of dynamic load of distributed computing network is determined to reach dynamic load balancing scheduling effect. The experimental results show that the method has strong anti-interference performance and the maximum amplitude of equilibrium state is 0.2. The data transmission throughput performance of distributed parallel computing network is improved.
引用
收藏
页码:139 / 146
页数:8
相关论文
共 10 条
[1]  
[Anonymous], 2014, J COMPUT RES DEV
[2]  
[毕安琪 Bi Anqi], 2016, [计算机研究与发展, Journal of Computer Research and Development], V53, P1029
[3]  
Carbone P., 2015, B TECH COMM DATA ENG, V38, DOI DOI 10.1109/IC2EW.2016.56
[4]  
Chen Yongna, 2017, Journal of Computer Applications, V37, P2806, DOI 10.11772/j.issn.1001-9081.2017.10.2806
[5]   Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit [J].
Donoho, David L. ;
Tsaig, Yaakov ;
Drori, Iddo ;
Starck, Jean-Luc .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (02) :1094-1121
[7]  
Huang Hongwei, 2017, Journal of Computer Applications, V37, P3207, DOI 10.11772/j.issn.1001-9081.2017.11.3207
[8]  
Ji Yugang, 2017, Journal of Computer Applications, V37, P3201, DOI 10.11772/j.issn.1001-9081.2017.11.3201
[9]   Exact Formulations for the Throughput of IEEE 802.11 DCF in Hoyt, Rice, and Nakagami-m Fading Channels [J].
Leonardo, Elvio J. ;
Yacoub, Michel D. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (05) :2261-2271
[10]   On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation [J].
Mernik, Marjan ;
Liu, Shih-Hsi ;
Karaboga, Dervis ;
Crepinsek, Matej .
INFORMATION SCIENCES, 2015, 291 :115-127