WRITE AVOIDANCE AREAS AROUND BAD BLOCKS ON A HARD DISK DRIVE PLATTER

• US 20140285917A1
• Filed: 03/20/2013
• Published: 09/25/2014
• Est. Priority Date: 03/20/2013
• Status: Active Grant

• Current Assignee: Lenovo International Limited (Lenovo Group Ltd.)
• Original Assignee: International Business Machines Corporation
• Inventors: Cudak, Gary D., Do, Lydia M., Hardee, Christopher J., Roberts, Adam
• Granted Patent: US 8,902,532 B2
• Time in Patent Office: Days
• US Class Current: 360/49
• CPC Class Codes: G11B 20/1889 with discs

Abstract

A method and computer program product identify the location of a bad block on a disk platter of a hard disk drive, determine an avoidance area extending from the bad block, and prevent data from being written to the avoidance area.

Claims

1. A computer program product including computer readable program code embodied on a non-transitory computer readable storage medium, the computer program product including:

computer readable program code for identifying the location of a bad block on a platter of a hard disk drive;

computer readable program code for determining an avoidance area extending from the bad block and encompassing the bad block; and

computer readable program code for preventing data from being written to the avoidance area.

3. The computer program product of claim 1, further comprising:

computer readable program code for notifying a user that the capacity of the hard disk drive has been reduced by the amount of the avoidance area.

4. The computer program product of claim 1, further comprising:

computer readable program code for copying data stored in the avoidance area to a destination area other than the avoidance area.

5. The computer program product of claim 4, wherein the destination area is on the same hard disk drive outside of the avoidance area.

6. The computer program product of claim 1, further comprising:

computer readable program code for preventing data from being written to the avoidance area until the disk reaches a utilization threshold.

7. The computer program product of claim 1, further comprising:

computer readable program code for preventing data from being written to the avoidance area until the disk has an insufficient amount of available area to store data in a write instruction.

8. The computer program product of claim 1, wherein the location of the bad block is identified by a physical memory address.

9. The computer program product of claim 1, further comprising:

computer readable program code for identifying the location of an additional bad block on the hard disk drive; and

computer readable program code for expanding the avoidance area to encompass the additional bad block.

10. The computer program product of claim 1, further comprising:

computer readable program code for identifying a group of bad blocks, wherein each bad block within the group is within a threshold distance from at least one other bad block; and

wherein the computer readable program code for determining an avoidance area extending from the bad block includes computer readable program code for determining an avoidance area extending from the group of bad blocks.

11. The computer program product of claim 10, further comprising:

computer readable program code for determining a growth rate of the area of the group of bad blocks, wherein the avoidance area is expanded at a rate proportional to the growth rate of the area of the group of bad blocks.

12. The computer program product of claim 10, further comprising:

computer readable program code for determining a growth rate of the area of the group of bad blocks, wherein the avoidance area is expanded at a logarithmic rate relative to the growth rate of the area of the group of bad blocks.

13. The computer program product of claim 1, further comprising:

computer readable program code for identifying a group of bad blocks within an area having greater than a threshold density of bad blocks; and

wherein the computer readable program code for determining an avoidance area extending from the bad block includes computer readable program code for determining an avoidance area extending from the group of bad blocks.

2. (canceled)

14. A computer-implemented method, comprising:

identifying the location of a bad block on a disk platter of a hard disk drive;

determining an avoidance area extending from the bad block and encompassing the bad block; and

preventing data from being written to the avoidance area.

15. The method of claim 14, further comprising:

notifying a user that the capacity of the hard disk drive has been reduced by the amount of the avoidance area.

16. The method of claim 14, further comprising:

copying data stored in the avoidance area to a destination area other than the avoidance area.

17. The method of claim 14, further comprising:

preventing data from being written to the avoidance area until the disk reaches a utilization threshold.

18. The method of claim 14, further comprising:

identifying the location of an additional bad block on the hard disk drive; and

expanding the avoidance area to encompass the additional bad block.

19. The method of claim 14, further comprising:

identifying a group of bad blocks, wherein each bad block within the group is within a threshold distance from at least one other bad block, wherein the avoidance area extends from the group of bad blocks.

20. The method of claim 14, further comprising:

identifying a group of bad blocks within an area having greater than a threshold density of bad blocks, wherein the avoidance area extends from the group of bad blocks.