Method and apparatus for reducing power consumption by a disk drive through disk block relocation

• US 5,787,296 A
• Filed: 09/27/1996
• Issued: 07/28/1998
• Est. Priority Date: 09/06/1996
• Status: Expired due to Term

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Coulson, Rick, Grimsrud, Knut
• Primary Examiner(s): Ray, Gopal C.
• Application Number:
  US08/721,840
• Time in Patent Office: 669 Days
• Field of Search: 395/750.03, 395/750.01, 360/69, 360/97.01, 360/71, 360/72.1, 711/170
• US Class Current: 713/320
• CPC Class Codes: G06F 1/3268 Power saving in hard disk drive
• CPC Class Codes: G06F 11/3442 for planning or managing the needed capacity
• CPC Class Codes: G06F 11/3485 for I/O devices
• CPC Class Codes: G06F 3/0625 Power saving in storage systems
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0676 Magnetic disk device
• CPC Class Codes: G11B 20/1883 Methods for assignment of alternate areas for defective areas
• CPC Class Codes: G11B 2220/20 Disc-shaped record carriers
• CPC Class Codes: G11B 27/034 on discs G11B27/036, G11B27/038 take precedence
• CPC Class Codes: Y02D 10/00 Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

An apparatus is programmed with a plurality of programming instructions for generating, if possible, an alternative disk block allocation for a current disk block allocation that will yield reduced overall power consumption for a sequence of disk accesses. In some embodiments, the programming instructions include the logic for tracing the sequence of disk accesses to determine the current disk block allocation, the logic for generating the alternative disk block allocation, if possible, using the trace results, and the logic for effectuating the alternate disk block allocation, if generated. In one particular embodiment, the logic for generating the alternative disk block allocation employs a random search approach, while in another embodiment, the logic for generating the alternative disk block allocation employs a heuristic approach.

Claims

1. An apparatus comprising

(a) an execution unit for executing programming instructions;

and

(b) a storage medium coupled to the execution unit and having stored therein a plurality of programming instructions to be executed by the execution unit for analyzing trace data of a sequence of disk accesses, the trace data including disk locations accessed and the order the disk locations are accessed, and for generating a new set of disk locations to relocate the contents of the accessed disk locations to reduce power consumed by the disk drive in effectuating access of the relocated contents, the new set of disk locations being generated employing a cost function that relates power consumption by power consuming elements of the disk drive to disk locations and the order the disk locations are accessed.

2. The apparatus as set forth in claim 1, wherein the plurality of programming instructions include programming instructions for tracing the sequence of disk accesses, and generating the trace data.

3. The apparatus as set forth in claim 1, wherein the plurality of programming instructions include programming instructions for generating a remapping vector mapping the disk locations accessed to the new set of disk locations.

4. The apparatus as set forth in claim 3, wherein the plurality of programming instructions include programming instructions for relocating the disk locations accessed to the new set of disk locations using the remapping vector.

5. The apparatus as set forth in claim 1, wherein the plurality of programming instructions include programming instructions for optimizing a cost function that relates power consumption resulted from head movements and active time of electronic components of the disk drive to disk locations and the order the disk locations are accessed, to generate the new set of disk locations.

6. The apparatus as set forth in claim 5, wherein the plurality of programming instructions include programming instructions for generating a new set of disk locations, and determining if the generated new set of disk locations yields reduction in power consumption by the disk drive using the cost function.

7. The apparatus as set forth in claim 6, wherein the plurality of programming instructions further include programming instructions for repeating the generation of an arbitrary set of disk locations, and the determination of whether the generated arbitrary set of disk locations yields reduction in power consumption by the disk drive using the cost function.

8. The apparatus as set forth in claim 5, wherein the plurality of programming instructions include programming instructions for coalescing disk blocks of a disk drive.

9. The apparatus as set forth in claim 5, wherein the plurality of programming instructions include programming instructions for grouping the disk accesses into access runs.

10. The apparatus as set forth in claim 9, wherein the plurality of programming instructions further include programming instructions for generating new disk locations for the disk locations accessed by the various access runs.

11. The apparatus as set forth in claim 10, wherein the plurality of programming instructions further include programming instructions for generating new disk locations from top most portions of a disk region in a top down manner for access runs having run lengths of a first run length kind.

12. The apparatus as set forth in claim 10, wherein the plurality of programming instructions further include programming instructions for generating new disk locations from bottom most portions of a disk region in a bottom up manner for access runs having run lengths of a first run length kind.

13. The apparatus as set forth in claim 10, wherein the plurality of programming instructions further include programming instructions for alternatingly generating new disk locations from top most portions of a disk region in a top down manner and from bottom most portions of the disk region in a bottom up manner for access runs having run length of a first run length kind.

14. The apparatus as set forth in claim 10, wherein the plurality of programming instructions further include programming instructions for generating new disk locations from center portions of a disk region for access runs having run lengths of a first run length kind.

15. The apparatus as set forth in claim 14, wherein the programming instructions for generating new disk locations from center portions of a disk region for access runs having run lengths of a first run length kind, generates the new disk locations factoring into consideration likelihood of occurrence of interrelated access runs of the same first run length kind.

16. The apparatus as set forth in claim 1, wherein the apparatus is a computer system.

17. The apparatus as set forth in claim 16, wherein the programming instructions are part of a service utility.

18. The apparatus as set forth in claim 16, wherein the programming instructions are part of an installation procedure of an application program that makes the sequence of disk accesses.

19. The apparatus as set forth in claim 1, wherein the apparatus is a disk drive controller.

20. A machine implemented method comprising the steps of:

a) tracing a sequence of disk accesses, and generating trace data for the disk accesses traced including disk locations accessed and the order the disk locations are accessed;

b) generating, if possible, a new set of disk locations to relocate the contents of the disk locations accessed, wherein the new set of disk locations are to yield reduction in power consumption by the disk drive when effectuating access of the relocated contents, and the new set of disk locations are to be generated employing a cost function that relates power consumption by power consuming elements of the disk drive to disk locations and the order the disk locations are accessed.

21. The method as set forth in claim 20, wherein the method further includes the step of (c) generating a remapping vector mapping the disk locations accessed to the new set of disk locations, if step (b) was successful in generating the new set of disk locations.

22. The machine implemented method as set forth in claim 21, wherein the method further includes the step (d) relocating the disk locations accessed to the new set of disk locations using the remapping vector, if step (c) was performed.

23. The machine implemented method as set forth in claim 20, wherein step (b) includes optimizing a cost function that relates power consumption of a disk drive resulted from head movements and active time of electronic components of the disk drive to disk locations and the order the disk locations are accessed.

24. The machine implemented method as set forth in claim 23, wherein the cost function optimization of step (b) includes generating a new set of disk locations, and determining if the generated arbitrary set of disk locations yields reduction in power consumption by the disk drive using the cost function.

25. The machine implemented method as set forth in claim 24, wherein the cost function optimization of step (b) further includes repeating the generation of an arbitrary set of disk locations, and the determination of whether the generated arbitrary set of disk locations yields reduction in power consumption by the disk drive using the cost function.

26. The machine implemented method as set forth in claim 23, wherein step (b) further includes coalescing disk blocks of a disk drive.

27. The machine implemented method as set forth in claim 23, wherein step (b) further includes grouping the disk accesses into access runs.

28. The machine implemented method as set forth in claim 27, wherein step (b) the generation of new disk locations for the disk locations accessed of step (b) is performed by generating new disk locations for the various access runs.

29. The machine implemented method as set forth in claim 28, wherein the generation of new disk locations of step (b) includes generating new disk locations from top most portions of a disk region in a top down manner for access runs having run lengths of a first run length kind.

30. The machine implemented method as set forth in claim 28, wherein the generation of new disk locations of step (b) includes generating new disk locations from bottom most portions of a disk region in a bottom up manner for access runs having run lengths of a first run length kind.

31. The machine implemented method as set forth in claim 28, wherein the generation of new disk locations of step (b) includes alternatingly generating new disk locations from top most portions of a disk region in a top down manner and from bottom most portions of the disk region in a bottom up manner for access runs having run length of a first run length kind.

32. The machine implemented method as set forth in claim 28, wherein the generation of new disk locations of step (b) includes generating new disk locations from center portions of a disk region for access runs having run lengths of a first run length kind.

33. The machine implemented method as set forth in claim 32, wherein the generation of new disk locations from center portions of a disk region for access runs having run lengths of a first run length kind, includes factoring into consideration likelihood of occurrence of interrelated access runs of the same first run length kind.

34. A storage medium having stored therein a plurality of programming instructions to be executed by an execution unit for analyzing trace data of a sequence of disk accesses, the trace data including disk locations accessed and the order the disk locations are accessed, and for generating a new set of disk locations to relocate the contents of the accessed disk locations to reduce power consumed by disk drive when effectuating access of the relocated contents, the new set of disk locations being generated employing a cost function that relates power consumption by power consuming elements of the disk drive to disk locations and the order the disk locations are accessed.

35. The storage medium as set forth in claim 34, wherein the plurality of programming instructions include programming instructions for optimizing a cost function that relates power consumption resulted from head movements and active time of electronic components of the disk drive to disk locations and the order the disk locations are accessed, to generate the new set of disk locations.

36. The storage medium as set forth in claim 35, wherein the plurality of programming instructions include programming instructions for generating a new set of disk locations, and determining if the generated new set of disk locations yields reduction in power consumption by the disk drive using the cost function.

37. The storage medium as set forth in claim 36, wherein the plurality of programming instructions further include programming instructions for repeating the generation of an arbitrary set of disk locations, and the determination of whether the generated arbitrary set of disk locations yields reduction in power consumption by the disk drive using the cost function.

38. The storage medium as set forth in claim 35, wherein the plurality of programming instructions include programming instructions for coalescing disk blocks of a disk drive.