Performance oriented data deduplication and duplication

Abstract

A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.

What is claimed is: 
     
         1 . A system, comprising:
 at least one processing component;   at least one memory component;   an access tracking component configured to:
 determine a quantity of access requests for at least one data block; 
 determine a quantity of current copies of the at least one copy; 
 determine whether an input/output bottleneck forms when at least one application requests access to the at least one data block; and 
 measure a length of a read latency for accessing the at least one data block; 
   a duplication component configured to:
 create at least one additional copy of the at least one data block when the quantity of the access requests for the at least one data block exceeds an access request threshold, wherein the access request threshold is a given quantity of access requests for the at least one data block within a given period of time; and 
   a deduplication component configured to:
 remove at least one current copy of the at least one data block when the quantity of the access requests for the at least one data block falls below the access request threshold; 
 remove the at least one current copy of the at least one data block when the quantity of current copies of the at least one data block exceeds a threshold number of data blocks; 
 move the at least one current copy of the at least one data block when the input/output bottle neck is formed; 
 move the at least one current copy of the at least one data block when the length of the read latency exceeds a threshold length; and 
 redistribute the at least one current copy of the at least one data block to one or more locations.