J4 ›› 2011, Vol. 49 ›› Issue (06): 1105-1110.

Previous Articles     Next Articles

A New Type Weights Distribution Scheduling Algorithmwith Priority Processing Capability

LIU Min1,2, FANG Zhiyi1, WANG Hongbin1, ZHANG Xi1   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. Department of Public Education, Changchun Automobile Industry Institute, Changchun 130011, China
  • Received:2010-10-21 Online:2011-11-26 Published:2011-11-28
  • Contact: LIU Min E-mail:liumin8188@sina.com

Abstract:

In view of the accuracy of the service node weight in weighted least connection algorithm directly affects the load balancing efficiency and the integer cluster system performance. We proposed a new improved algorithm: priority processing capacity weights distribution scheduling algorithm, described the work process and algorithm thought in the improved algorithm, analysed and designed the improved algorithm’s main technology, main module and principle. The improved algorithm solves the LVS load imbalance problem; the LVS performance and stability are improved to some extent. The experiment comparative analysis shows the improved algorithm is more optimal than weighted least connections algorithm in dynamic balance.

Key words: LVS(Linux virtual server) cluster, scheduling algorithm, weights distribution method

CLC Number: 

  • TP393