SYSTEM AND METHOD FOR TIERED CACHING AND STORAGE ALLOCATION

• US 20150039837A1
• Filed: 03/06/2014
• Published: 02/05/2015
• Est. Priority Date: 03/06/2013
• Status: Active Application

• Current Assignee: Condusiv Technologies Corporation
• Original Assignee: Condusiv Technologies Corporation
• Inventors: Cadruvi, Richard, Quan, Gary, Thomas, Basil, Panchal, Kalindi, Dinesababu, Bidin
• Application Number:
  US14/199,449
• Publication Number:
  US 20150039837A1
• Time in Patent Office: Days
• US Class Current: 711/136
• CPC Class Codes: G06F 12/0868 Data transfer between cache memory and other subsystems, e.g. storage devices or host systems
• CPC Class Codes: G06F 12/0871 Allocation or management of cache space
• CPC Class Codes: G06F 12/0888 using selective caching, e.g. bypass
• CPC Class Codes: G06F 12/0897 with two or more cache hierarchy levels with multilevel cache hierarchies G06F12/0811
• CPC Class Codes: G06F 12/122 of the least frequently used [LFU] type, e.g. with individual count value
• CPC Class Codes: G06F 2212/604 Details relating to cache allocation
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0631 by allocating resources to storage systems
• CPC Class Codes: G06F 3/0685 Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays

Abstract

Method for data placement in a tiered caching system and/or tiered storage system includes: determining a first period of time between each access to a first data, in a predetermined time window; averaging the first periods of time between each access to obtain an average first period of time; determining a second period of time between each access to a second data, in said predetermined time window; averaging the second periods of time between each access to obtain an average second period of time; comparing the average first period of time and the average second period of time; placing the first data in a fast-access storage medium, when the average first period of time is less than the average second period of time; and placing the second data in the fast-access storage medium, when the average second period of time is less than the average first period of time.

Claims

1. A method for data placement, the method comprising:

determining a first period of time between each access to a first data, in a predetermined time window;

averaging the first periods of time between each access to obtain an average first period of time;

determining a second period of time between each access to a second data, in said predetermined time window;

averaging the second periods of time between each access to obtain an average second period of time;

comparing the average first period of time and the average second period of time;

placing the first data in a fast-access storage medium, when the average first period of time is less than the average second period of time; and

placing the second data in the fast-access storage medium, when the average second period of time is less than the average first period of time.

2. The method of claim 1, wherein the fast-access storage medium is a tiered cache and placing the data in the cache comprises of caching the data in the tiered cache.

3. The method of claim 2, further comprising using the average first period of time and the average second period of time and a historical access data for the first and second data to remove the first or second data from said tiered cache.

4. The method of claim 3, further comprising determining a threshold of non-use for each of the first and second data, from the historical access data for the first and second data, respectively and the non-use thresholds and the average first period of time and the average second period of time to remove the first or second data from said tiered cache.

5. The method of claim 2, further comprising determining which of the first or second data is accessed most frequently, based on one or more of previous usage pattern, past utilization and time of utilization, current utilization and time of utilization, and current and past average utilization and the time duration of the utilization;

and moving the first or second data that is accessed less frequently from the tiered cache.

6. The method of claim 2, further comprising using the average first period of time and the average second period of time and a historical access to the first and second data to remove the first or second data from a first tier of said tiered cache to a second tier of said tiered cache.

7. The method of claim 2, further comprising comparing the average first period of time or the average second period of time to a threshold and placing the first or second data set in an optimum cache tier, if the average first or second period of time is below said threshold.

8. The method of claim 2, further comprising using the cached data in the tiered cache for one or more of data redundancy and recovery.

9. The method of claim 2, further comprising using a digest, a signature or a time stamp of a journal or log file content of a file system to compute a file system signature and utilizing the file system signature at a system shutdown or a system start up to validate the cached data in the tiered cache.

10. The method of claim 1, further comprising organizing the placed data in the fast-access storage medium for faster and more efficient processing by setting up different zones for different categories of data, based on data attributes.

11. The method of claim 1, further comprising using the placed data in the fast-access storage medium to queue data before the data is written to a final storage location, based on characteristics of the data;

and block writing the queued data to the final storage location.

12. The method of claim 1, wherein the fast-access storage medium is a tiered storage medium and placing the data in the tiered storage medium comprises of storing the data in the tiered storage medium.

13. The method of claim 12, further comprising using the average first period of time and the average second period of time and a historical access data for the first and second data to place the first or second data to an optimum tier of said tiered storage.

14. The method of claim 12, further comprising comparing the average first period of time or the average second period of time to a threshold and placing the first or second data set in an optimum storage tier if the average first or second period of time is below said threshold.

15. A non-transitory computer readable storage medium comprising one or more of instructions, which when executed by one or more processors cause:

monitoring a first period of time between each access to a first data, in a predetermined time window;

averaging the first periods of time between each access to obtain an average first period of time;

monitoring a second period of time between each access to a second data, in said predetermined time window;

averaging the second periods of time between each access to obtain an average second period of time;

comparing the average first period of time and the average second period of time;

placing the first data in a fast-access storage medium, when the average first period of time is less than the average second period of time; and

placing the second data in the fast-access storage medium, when the average second period of time is less than the average first period of time.

16. The non-transitory computer readable storage medium of claim 15, wherein the fast-access storage medium is a tiered cache and placing the data in the cache comprises of caching the data in the tiered cache.

17. The non-transitory computer readable storage medium of claim 16, further comprising instructions, which when executed by the one or more processors cause using the average first period of time and the average second period of time and a historical access data for the first and second data to remove the first or second data from said tiered cache.

18. The non-transitory computer readable storage medium of claim 17, further comprising instructions, which when executed by the one or more processors cause determining a threshold of non-use for each of the first and second data, from the historical access data for the first and second data, respectively and the non-use thresholds and the average first period of time and the average second period of time to remove the first or second data from said tiered cache.

19. The non-transitory computer readable storage medium of claim 15, wherein the fast-access storage medium is a tiered storage medium and placing the data in the tiered storage medium comprises of storing the data in the tiered storage medium.

20. The non-transitory computer readable storage medium of claim 19, further comprising instructions, which when executed by the one or more processors cause using the average first period of time and the average second period of time and a historical access data for the first and second data to place the first or second data to an optimum tier of said tiered storage.