A scheduling algorithm for load balance sensitive storage

According to the scheduling problem in storage aggregating of application-level, a scheduling algorithm for load balance sensitive storage (LBS) is proposed based on policy. In the LBS algorithm, requirements from applications for storage are represented as a series of restrictions. The LBS then makes choice between new appropriate storage nodes and existing scheduling scenario by analyzing relations between restrictions so that the reusability of scheduler scenarios can be improved. The LBS maintains the balance between the reusability of policy and the load of storage, and achieves the goal of load balance finally. The simulation and comparisons show that the LBS outperforms the Random and the Least obviously in load balancing, policy decupling and scalability, and that the load balance of the LBS improves 10 times against the two baseline algorithms.