Variable-size data item placement for load and storage balancing

• Published in: The Journal of systems and software 2003-05, Vol.66 (2), p.157-166
• Main Authors: Ma, Yung-Cheng, Chiu, Jih-Ching, Chen, Tien-Fu, Chung, Chung-Ping
• Format: Article
• Language: English
• Subjects: Algorithms; Information storage; Studies
• ISSN: 0164-1212; 1873-1228
• DOI: 10.1016/S0164-1212(02)00073-0

The rapid growth of Internet brings the need for a low cost high performance file system. Two objectives are to be pursued in building such a large scale storage system on multiple disks: load balancing and storage minimization. We investigate the optimization problem of placing variable-size data items onto multiple disks with replication to achieve the two objectives. An approximate algorithm, called LSB_ Placement, is proposed for the optimization problem. The algorithm performs bin packing along with MMPacking to obtain a load balanced placement with near-optimal storage balancing. The key issue in deriving the algorithm is to find the optimal bin capacity for the bin packing to reduce storage cost. We derive the optimal bin capacity and prove that LSB_ Placement algorithm is asymptotically 1-optimal on storage balancing. That is, when the problem size exceeds certain threshold, the algorithm generates a load balanced placement in which the data sizes allocated on disks are almost balanced. We demonstrate that, for various Web applications, a load balanced placement can be generated with disk capacity not exceeding 10% more than the balanced storage space. This shows that the LSB_ Placement algorithm is useful in constructing a low cost and high performance storage system.