DEFRAGMENTATION-LESS DEDUPLICATION

• US 20150074064A1
• Filed: 09/12/2013
• Published: 03/12/2015
• Est. Priority Date: 09/12/2013
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: GOLDBERG, Itzhack, SONDHI, Neil
• Granted Patent: US 10,049,117 B2
• Time in Patent Office: Days
• US Class Current: 707/692
• CPC Class Codes: G06F 16/1724 Details of de-fragmentation performed by the file system saving storage space on storage systems G06F3/0608; management of blocks in storage devices G06F3/064
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641

Abstract

For defragmentation-less deduplication using a processor device, holes are punched in a file in a data deduplication process for avoiding the use of defragmenting by allowing a file system to use the punched holes for reclaiming the free space for adding to a free space pool of the file system.

Claims

1. A method for defragmentation-less deduplication using a processor device, comprising:

punching holes in a file in a data deduplication process for avoiding the use of defragmenting by allowing a file system to use the punched holes for reclaiming the free space for adding to a free space pool of the file system.

2. The method of claim 1, further including punching a hole in a fragment of an existing, large fragmented file and returning the punch hole fragment to the free space of the file system for creating a new, larger fragmented file.

3. The method of claim 1, further including deleting existing, large fragmented files after losing all data in the existing, large fragmented files for saving index node space.

4. The method of claim 3, further including pointing the punched holes to a logical block address (LBA) zero.

5. The method of claim 1, further including retaining an original size of a punched hole for converting a populated file into a sparsely populated file.

6. The method of claim 1, further including using a fallocate command for the hole punching.

7. The method of claim 1, further including creating a new file from the punched holes during the data deduplication process.

8. A system for defragmentation-less deduplication in a computing environment, comprising:

a processor device, operable in the computing environment, wherein the at least one processor device;

punches holes in a file in a data deduplication process for avoiding the use of defragmenting by allowing a file system to use the punched holes for reclaiming the free space for adding to a free space pool of the file system.

9. The system of claim 8, wherein the processor device punches a hole in a fragment of an existing, large fragmented file and returning the punch hole fragment to the free space of the file system for creating a new, larger fragmented file.

10. The system of claim 8, wherein the processor device deletes existing, large fragmented files after losing all data in the existing, large fragmented files for saving index node space.

11. The system of claim 8, wherein the processor device points the punched holes to a logical block address (LBA) zero.

12. The system of claim 8, wherein the processor device retains an original size of a punched hole for converting a populated file into a sparsely populated file.

13. The system of claim 8, wherein the processor device uses a fallocate command for the hole punching.

14. The system of claim 8, wherein the processor device creates a new file from the punched holes during the data deduplication process.

15. A computer program product for applying a content defined minimum size bound on content defined blocks using a processor device in a computing environment, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

a first executable portion that punches holes in a file in a data deduplication process for avoiding the use of defragmenting by allowing a file system to use the punched holes for reclaiming the free space for adding to a free space pool of the file system.

16. The computer program product of claim 15, further including a second executable portion that punches a hole in a fragment of an existing, large fragmented file and returning the punch hole fragment to the free space of the file system for creating a new, larger fragmented file.

17. The computer program product of claim 15, further including a second executable portion that deletes existing, large fragmented files after losing all data in the existing, large fragmented files for saving index node space.

18. The computer program product of claim 15, further including a second executable portion that points the punched holes to a logical block address (LBA) zero.

19. The computer program product of claim 15, further including a second executable portion that:

retains an original size of a punched hole for converting a populated file into a sparsely populated file, and

uses a fallocate command for the hole punching.

20. The computer program product of claim 15, further including a second executable portion that creates a new file from the punched holes during the data deduplication process.