Hierarchical storage scheduling method and device, equipment and storage medium

Abstract

The embodiment of the invention provides a hierarchical storage scheduling method and device, equipment and a storage medium, and relates to the field of data storage, the method comprises the following steps: receiving a data access request sent by a client; if the first storage layer does not have the first target data object hit by the data access request, but the second storage layer has the first target data object, judging whether an idle storage space of the first storage layer reaches a preset storage space threshold value or not; wherein the data read-write rate of the first storage layer is greater than the data read-write rate of the second storage layer; if the free storage space does not reach the storage space threshold value, determining a to-be-migrated second target data object from the first storage layer by adopting a preset ant colony algorithm; and migrating the second target data object out of the first storage layer, and inserting the first target data object into the first storage layer. By adopting the method, the cache hit rate of the data can be improved, and the data reading timeliness is enhanced.

Description

technical field [0001] The present invention relates to the field of data storage, in particular to a hierarchical storage scheduling method, device, equipment and storage medium. Background technique [0002] The processing speed and data types of modern computers have undergone tremendous changes. Data access patterns and workload types have also increased year by year, and the requirements for the efficiency of data storage calls are getting higher and higher. [0003] In this case, the classic traditional replacement algorithm has been unable to meet the requirements of modern multimedia computers. The common cache replacement algorithms LRU algorithm, LFU algorithm, and 2Q algorithm all replace the cache data with the smallest cache value out of the cache when performing cache replacement. The difference is only in the judgment of the cache value, but they are all one-sided. [0004] Facing the problems of large scale, large amount of data, and high complexity in commo...

AI Technical Summary

Problems solved by technology

[0003] In this case, the classic traditional replacement algorithm has been unable to meet the requirements of modern multimedia computers

The common cache replacement algorithms LRU algorithm, LFU algorithm, and 2Q algorithm all replace the cache data with the smallest cache value out of the cache when performing cache replacement. The difference is only in the judgment of the cache value, but they are all one-sided.

[0004] Facing the problems of large scale, large data volume and high complexity of commonly used storage systems, there is an urgent need for a more comprehensive cache replacement algorithm to cooperate with storage systems to efficiently access stored data

Images