Data storage system with automated correction of reference counts in addressing structure to avoid capacity leakage
AssigneeDell Products L.P.
InventorsUri Shabi, Vladimir Shveidel, Jonathan Volij
Life of this patent
Estimating the term…
Loading patent…
AssigneeDell Products L.P.
InventorsUri Shabi, Vladimir Shveidel, Jonathan Volij
Estimating the term…
A method in a data storage system includes foreground processes that produce incorrect-high reference counts greater than corresponding numbers of actual references to associated data instances (e.g., virtual large blocks), representing loss of storage capacity. A background process corrects a reference count for a data instance by (1) copying the data instance to a new data instance with an initial reference count of zero and making the new data instance unavailable for reclaiming, (2) scanning a set of referencing structures for all references to the data instance, and for each reference (i) replacing the reference with a new reference to the new data instance, and (ii) incrementing the reference count of the new data instance, and (3) upon completing the scanning, making the new data instance available for eventual reclaiming based on its reference count reaching zero. The process restores reference count accuracy and reduces loss/leakage of storage capacity.
A method of operating a data storage system having data deduplication functionality including storage of unique data instances with associated reference counts each indicating a respective number of distinct references to the associated data instance, the storage system also having reclamation functionality that reclaims storage for reuse based on reference counts of associated data instances reaching zero, comprising:
A data storage system having storage processing circuitry and physical storage media, the storage processing circuitry executing computer program instructions to cause the data storage system to provide secondary data storage services to host computers including data deduplication functionality and reclamation functionality, the deduplication functionality including storage of unique data instances with associated reference counts each indicating a respective number of distinct references to the associated data instance, the reclamation functionality reclaiming storage for reuse based on reference counts of associated data instances reaching zero, the data storage services further including:
Dependencies are inferred from the claim text.