A load balancing algorithm with minimum links scheduling

Weiping Zhang; YanLing Chen; Zhonghao Liu; Yansheng Chen

doi:10.1117/12.2656556

20 October 2022 A load balancing algorithm with minimum links scheduling

Weiping Zhang, YanLing Chen, Zhonghao Liu, Yansheng Chen

Proceedings Volume 12451, 5th International Conference on Computer Information Science and Application Technology (CISAT 2022); 1245149 (2022) https://doi.org/10.1117/12.2656556
Event: 5th International Conference on Computer Information Science and Application Technology (CISAT 2022), 2022, Chongqing, China

Abstract

In the limited resource scenario of the public computer room, the FTP service resource sharing platform cannot bear the computing requirements required for the rapid growth of access, data capacity, network traffic, etc. based on an independent server. Based on the Least Link Scheduling (LVS) strategy, designed and implemented the minimum link load balancing scheduling algorithm. In the normal experimental environment of the public computer room, we increase the backup scheduling server and intensively schedule the server redundant resources of the shared platform to evaluate the performance of the load balancing scheduling algorithm in terms of transmission speed, the maximum number of users, and the read speed of the server disk. The experimental results show that the performance of the resource sharing platform based on the minimum link load balancing scheduling algorithm is significantly improved, achieving 2.21 times, 3.00 times and 5.60 times increments, which is of practical significance for promoting the efficient use of computer sharing platform resources under the condition of limited resources.

Citation Download Citation

Weiping Zhang, YanLing Chen, Zhonghao Liu, and Yansheng Chen "A load balancing algorithm with minimum links scheduling", Proc. SPIE 12451, 5th International Conference on Computer Information Science and Application Technology (CISAT 2022), 1245149 (20 October 2022); https://doi.org/10.1117/12.2656556

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available