Optimized sort partition: A file assignment strategy to achieve minimized response time for parallel storage systems

Prompt response to data access requests is the key performance concern of parallel storage systems. To the best of our knowledge, Sort Partition (SP) is one of the most promising file allocation solutions in the static scenario due to its sorted partition and placing mechanism. The online variant of SP, Hybrid Partition (HP), however, does not perform well in the dynamic scenario. The recently proposed Balanced Allocation with Sort (BAS) and its online version Balanced Allocation with Sort for Batch (BASB) try to compete with SP and HP by providing better load balancing together with sorting. BAS´s performance is close to SP, and BASB performs much better than HP in the dynamic scenario. In this paper, we proposed new file placement solutions for the parallel storage systems: Optimized Sort Partition (OSP) for the static scenario and Optimized Sort Partition Online (OSPOnline) for the dynamic scenario. By eliminating the drawbacks of SP/HP and BAS/BASB in the file assignment, OSP and OSPOnline can always achieve optimized sort partition and good load balancing simultaneously. Conducted simulations show that OSP and OSPOnline steadily outperform their competitors under various conditions.