# US 2017/0285952 A1 · System and method for quasi-compacting garbage collection > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2017/0285952 A1 - Document ID: US20170285952A1 - Status: Published application - Kind: A1 - Application number: 15/367,666 - Filed: 2016-12-02 - Published: 2017-10-05 - Earliest claimed: 2016-03-31 - Assignees: EMC IP Holding Company LLC - Applicants: EMC IP Holding Company LLC - Inventors: MIKHAIL DANILOV; Mikhail Malygin; Ivan Tchoub; Andrey Fomin; Maxim Trusov - Web page: https://patentgrep.com/patent/US20170285952A1 ## CPC - G06F 3/064: {Management of blocks} - G06F 3/0608: {Saving storage space on storage systems} - G06F 3/0625: {Power saving in storage systems} - G06F 3/0652: {Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket} - G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]} - G06F 3/0671: {In-line storage system} - G06F 12/0246: {in block erasable memory, e.g. flash memory} - G06F 12/0253: {Garbage collection, i.e. reclamation of unreferenced memory} - Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE ## Abstract A method, computer program product, and computer system for identifying, by a computing device, a plurality of used chunks, wherein the plurality of used chunks may include a plurality of free blocks and at least one non-free block. A capacity of the plurality of free blocks that is available to reclaim may be verified. The capacity of the plurality of free blocks may be reclaimed. A composite chunk from the plurality of free blocks may be created. ## Claims ### Claim 1 A computer-implemented method comprising: identifying a plurality of used chunks, wherein the plurality of used chunks includes a plurality of free blocks and at least one non-free block; verifying that a capacity of the plurality of free blocks is available to reclaim; reclaiming the capacity of the plurality of free blocks; and creating a composite chunk from the plurality of free blocks. ### Claim 2 (depends on 1) The computer-implemented method of claim 1 wherein the plurality of used chunks includes at least one repository chunk, wherein the at least one repository chunk includes user data. ### Claim 3 (depends on 1) The computer-implemented method of claim 1 wherein the capacity of the plurality of free blocks is reclaimed while at least one of the plurality of used chunks is in use by the at least one non-free block. ### Claim 4 (depends on 1) The computer-implemented method of claim 1 wherein verifying that the capacity of the plurality of free blocks is available to reclaim includes ignoring at least a portion of the plurality of free blocks that is below a threshold size. ### Claim 5 (depends on 1) The computer-implemented method of claim 1 wherein verifying that the capacity of the plurality of free blocks is available to reclaim includes shortening a free block of the plurality of free blocks that is above a threshold size. ### Claim 6 (depends on 1) The computer-implemented method of claim 1 wherein the composite chunk includes a first portion of the plurality of free blocks from a first chunk of the plurality of used chunks, and a second portion of the plurality of free blocks from a second chunk of the plurality of used chunks. ### Claim 7 (depends on 1) The computer-implemented method of claim 1 wherein the composite chunk is created without moving the plurality of free blocks and the at least one non-free block. ### Claim 8 A computer program product residing on a computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, cause at least a portion of the one or more processor to perform operations comprising: identifying a plurality of used chunks, wherein the plurality of used chunks includes a plurality of free blocks and at least one non-free block; verifying that a capacity of the plurality of free blocks is available to reclaim; reclaiming the capacity of the plurality of free blocks; and creating a composite chunk from the plurality of free blocks. ### Claim 9 (depends on 8) The computer program product of claim 8 wherein the plurality of used chunks includes at least one repository chunk, wherein the at least one repository chunk includes user data. ### Claim 10 (depends on 8) The computer program product of claim 8 wherein the capacity of the plurality of free blocks is reclaimed while at least one of the plurality of used chunks is in use by the at least one non-free block. ### Claim 11 (depends on 8) The computer program product of claim 8 wherein verifying that the capacity of the plurality of free blocks is available to reclaim includes ignoring at least a portion of the plurality of free blocks that is below a threshold size. ### Claim 12 (depends on 8) The computer program product of claim 8 wherein verifying that the capacity of the plurality of free blocks is available to reclaim includes shortening a free block of the plurality of free blocks that is above a threshold size. ### Claim 13 (depends on 8) The computer program product of claim 8 wherein the composite chunk includes a first portion of the plurality of free blocks from a first chunk of the plurality of used chunks, and a second portion of the plurality of free blocks from a second chunk of the plurality of used chunks. ### Claim 14 (depends on 8) The computer program product of claim 8 wherein the composite chunk is created without moving the plurality of free blocks and the at least one non-free block. ### Claim 15 A computing system including one or more processors and one or more memories configured to perform operations comprising: identifying a plurality of used chunks, wherein the plurality of used chunks includes a plurality of free blocks and at least one non-free block; verifying that a capacity of the plurality of free blocks is available to reclaim; reclaiming the capacity of the plurality of free blocks; and creating a composite chunk from the plurality of free blocks. ### Claim 16 (depends on 15) The computing system of claim 15 wherein the plurality of used chunks includes at least one repository chunk, wherein the at least one repository chunk includes user data. ### Claim 17 (depends on 15) The computing system of claim 15 wherein the capacity of the plurality of free blocks is reclaimed while at least one of the plurality of used chunks is in use by the at least one non-free block. ### Claim 18 (depends on 15) The computing system of claim 15 wherein verifying that the capacity of the plurality of free blocks is available to reclaim includes ignoring at least a portion of the plurality of free blocks that is below a threshold size. ### Claim 19 (depends on 15) The computing system of claim 15 wherein verifying that the capacity of the plurality of free blocks is available to reclaim includes shortening a free block of the plurality of free blocks that is above a threshold size. ### Claim 20 (depends on 15) The computing system of claim 15 wherein the composite chunk includes a first portion of the plurality of free blocks from a first chunk of the plurality of used chunks, and a second portion of the plurality of free blocks from a second chunk of the plurality of used chunks.