Data Location Optimization Method for Improvement Performance for Tiered Storage

Abstract

We propose a new method for tiered storage and evaluate the characteristics of the method. In this method, a fast tier is divided into two areas, and the data in each area is managed on the basis of two I/O (Input/Output) measurement periods. When I/Os to these areas increase, the proposed method allocates frequently accessed areas to a fast tier in advance, therefore, improving the storage I/O performance. We evaluate our proposed method by simulating storage I/Os and data migration between tiers. When I/O locality is high or frequently accessed areas rarely move, the proposed method is the most effective and improves the storage I/O performance by up to 44.9%.