Abstract
There is a notable characteristic of the data access pattern: 80% I/O requests only access 20% data. This feature brings about the concept of hotspot data, which refer to the data in the most frequent requested area. The access to these hotspot data has direct influence upon the performance of the storage system's applications. Therefore, how to predict hotspot data is a critical research focus in the optimization of the storage system. In this paper, we propose a hotspot data prediction model based on a Zipf-like distribution, which can estimate and dynamically adjust parameters according to the present statistics of I/O access. We classify the hotspot data from every trace, and analyse the prediction rate through the classified hotspot data's characteristic. We synthesize the analysis results in different time granularities and hotspot data prediction queue lengths. Finally, we use block I/O traces to discuss the effectiveness of this model. The discussion and analysis results indicate that this model can predict the hotspot data efficiently.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
