DATA PROGRESSION DISK LOCALITY OPTIMIZATION SYSTEM AND METHOD

• US 20080091877A1
• Filed: 05/24/2007
• Published: 04/17/2008
• Est. Priority Date: 05/24/2006
• Status: Abandoned Application

• Current Assignee: Dell International LLC (Dell Technologies Inc.)
• Original Assignee: Dell International LLC (Dell Technologies Inc.)
• Inventors: Klemm, Michael, Aszmann, Lawrence
• Application Number:
  US11/753,357
• Publication Number:
  US 20080091877A1
• Time in Patent Office: Days
• US Class Current: 711/114
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0638 Organizing or formatting or addressing of data
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD

Abstract

The present disclosure relates to disk drive systems and methods having data progression and disk placement optimizations. Generally, the systems and methods include continuously determining a cost for data on a plurality of disk drives, determining whether there is data to be moved from a first location on the disk drives to a second location on the disk drives, and moving data stored at the first location to the second location. The first location is a data track that is located generally concentrically closer to a center of a first disk drive than the second location is located relative to a center of a second disk drive. In some embodiments, the first and second location are on the same disk drive.

Claims

1. A method of disk locality optimization in a disk drive system, comprising:

determining a cost for each of a plurality of data on a plurality of disk drives of the disk drive system;

determining whether there is data to be moved from a first location on the plurality of disk drives to a second location on the plurality of disk drives; and

moving data stored at the first location to the second location;

wherein the first location is a data track that is located generally concentrically closer to a center of a first disk drive than the second location is located relative to a center of a second disk drive.

2. The method of claim 1, wherein the cost of each of the plurality of data is based on the access pattern of the data.

3. The method of claim 2, wherein determining whether there is data to be moved from a first location on the plurality of disk drives to a second location on the plurality of disk drives comprises determining whether data on the first location has an access pattern suitable for moving to the second location.

4. The method of claim 2, wherein the first and second disk drive are the same and the second location is a data track located on the first disk drive.

5. The method of claim 3, wherein the plurality of data on the plurality of disk drives comprises data from a plurality of RAID devices allocated into volumes.

6. The method of claim 5, wherein each of the plurality of data on the plurality of disk drives comprises a subset of a volume.

7. The method of claim 1, further comprising:

determining whether there is data to be moved from a third location on the plurality of disk drives to a fourth location on the plurality of disk drives; and

moving data stored at the third location to the fourth location;

wherein the third location is a data track that is located generally concentrically further away from a center of a third disk drive than the fourth location is located relative to a center of a fourth disk drive.

8. The method of claim 7, wherein the cost of each of the plurality of data is based on at least one of the access pattern of the data and the type of data.

9. The method of claim 8, wherein data is moved from the third location to the fourth location if the data comprises historical snapshot data.

10. The method of claim 8, wherein the third and fourth disk drives are the same and the fourth location is a data track located on the third disk drive.

11. A disk drive system, comprising:

a RAID subsystem comprising a pool of storage; and

a disk manager having at least one disk storage system controller configured to;

determine a cost for each of a plurality of data on a plurality of disk drives of the disk drive system;

continuously determine whether there is data to be moved from a first location on the plurality of disk drives to a second location on the plurality of disk drives; and

move data stored at the first location to the second location;

wherein the first location is a data track that is located generally concentrically closer to a center of a first disk drive than the second location is located relative to one of the center of the first disk drive and a center of a second disk drive.

12. The system of claim 11, wherein the disk drive system comprises storage space from at least one of a plurality of RAID levels including RAID-0, RAID-1, RAID-5, and RAID-10.

13. The system of claim 12, further comprising RAID levels including RAID-3, RAID-4, RAID-6, and RAID-7.

14. A disk drive system capable of disk locality optimization, comprising:

means for storing data;

means for checking a plurality of data on the means for storing data to determine whether there is data to be moved from a first location to a second location, wherein the first location is a data track located in a higher performing mechanical position of the means for storing data than the second location; and

means for moving data stored in the first location to the second location.

15. The disk drive system of claim 14, wherein the first location is a data track that is located generally concentrically closer to a center of a first disk drive than the second location is located relative to one of the center of the first disk drive and a center of a second disk drive.

16. A method for reducing the cost of storing data, comprising:

assessing an access pattern for data stored on a first disk; and

based on at least the access pattern, moving data to at least one of outer tracks and inner tracks of a second disk.

17. The method of claim 16, wherein the first and second disk drives are the same disks.

18. The method of claim 16, wherein the first and second disk drives are different disks.