Improved Algorithm on File Dynamic Allocation of Cluster Server
Xinrong Liu · Jisuanji gongcheng · 2007
An improved algorithm on file allocation among server clusters is proposed based on the MMPacking algorithm. File is allocated according to the degree of cumulative demand and the server’s residual bandwidth. File is periodically allocated to all servers’ nodes. After finishing each round of file allocation, the next file allocation begins with the first node. Before the file allocation of each new round, all nodes are arrayed again in descending order according to the new residual bandwidth. After a file having been allocated to a node, the new round of file allocation will be restarted if the residual bandwidth of current node is more excessive than that of the next node. This algorithm can reduce the extra system consumption that dues to the change of client demand or the change of server’s configuration, and the load balance can be achieved more efficiently. Simulation results show that the improved algorithm is superior to the MMPacking algorithm.