US20230409546A1 - Compression Algorithm Based On Resource Availability - Google Patents
Compression Algorithm Based On Resource Availability Download PDFInfo
- Publication number
- US20230409546A1 US20230409546A1 US18/457,978 US202318457978A US2023409546A1 US 20230409546 A1 US20230409546 A1 US 20230409546A1 US 202318457978 A US202318457978 A US 202318457978A US 2023409546 A1 US2023409546 A1 US 2023409546A1
- Authority
- US
- United States
- Prior art keywords
- data
- data compression
- compression algorithm
- storage system
- utilize
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 230
- 238000007906 compression Methods 0.000 title description 56
- 230000006835 compression Effects 0.000 title description 56
- 238000003860 storage Methods 0.000 claims abstract description 230
- 238000013144 data compression Methods 0.000 claims abstract description 218
- 238000001514 detection method Methods 0.000 claims abstract 4
- 238000012545 processing Methods 0.000 claims description 86
- 238000000034 method Methods 0.000 claims description 67
- 230000006837 decompression Effects 0.000 claims description 63
- 230000009467 reduction Effects 0.000 claims description 47
- 238000004590 computer program Methods 0.000 claims description 23
- 230000008859 change Effects 0.000 claims description 4
- 238000012913 prioritisation Methods 0.000 description 33
- 238000004891 communication Methods 0.000 description 19
- 238000012544 monitoring process Methods 0.000 description 9
- 238000010276 construction Methods 0.000 description 6
- 238000003491 array Methods 0.000 description 5
- 230000004044 response Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 239000004744 fabric Substances 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 239000000835 fiber Substances 0.000 description 3
- 230000002085 persistent effect Effects 0.000 description 3
- 230000007774 longterm Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 101100498818 Arabidopsis thaliana DDR4 gene Proteins 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000009987 spinning Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2365—Ensuring data consistency and integrity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
Definitions
- FIG. 2 sets forth a block diagram of a storage array controller useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- FIG. 3 sets forth a flow chart illustrating an example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- FIG. 4 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- FIG. 6 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- FIG. 7 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- FIG. 8 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- FIG. 9 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- the computing devices ( 164 , 166 , 168 , 170 ) in the example of FIG. 1 are coupled for data communications to a number of storage arrays ( 102 , 104 ) through a storage area network (‘SAN’) ( 158 ) as well as a local area network ( 160 ) (‘LAN’).
- the SAN ( 158 ) may be implemented with a variety of data communications fabrics, devices, and protocols. Example fabrics for such a SAN ( 158 ) may include Fibre Channel, Ethernet, Infiniband, Serial Attached Small Computer System Interface (‘SAS’), and the like.
- SAS Serial Attached Small Computer System Interface
- Example data communications protocols for use in such a SAN may include Advanced Technology Attachment (‘ATA’), Fibre Channel Protocol, SCSI, iSCSI, HyperSCSI, and others. Readers of skill in the art will recognize that a SAN is just one among many possible data communications couplings which may be implemented between a computing device ( 164 , 166 , 168 , 170 ) and a storage array ( 102 , 104 ).
- ATA Advanced Technology Attachment
- SCSI Serial Bus Adapter
- iSCSI iSCSI
- HyperSCSI HyperSCSI
- the storage devices ( 146 , 150 ) within the storage arrays ( 102 , 104 ) may also be coupled to the computing devices ( 164 , 166 , 168 , 170 ) as network attached storage (‘NAS’) capable of facilitating file-level access, or even using a SAN-NAS hybrid that offers both file-level protocols and block-level protocols from the same system.
- NAS network attached storage
- the example storage arrays ( 102 , 104 ) of FIG. 1 provide persistent data storage for the computing devices ( 164 , 166 , 168 , 170 ).
- Each storage array ( 102 , 104 ) depicted in FIG. 1 includes a storage array controller ( 106 , 112 ).
- Each storage array controller ( 106 , 112 ) may be embodied as a module of automated computing machinery comprising computer hardware, computer software, or a combination of computer hardware and software.
- the storage array controllers ( 106 , 112 ) may be configured to carry out various storage-related tasks.
- Such tasks may include writing data received from the one or more of the computing devices ( 164 , 166 , 168 , 170 ) to storage, erasing data from storage, retrieving data from storage to provide the data to one or more of the computing devices ( 164 , 166 , 168 , 170 ), monitoring and reporting of disk utilization and performance, performing RAID (Redundant Array of Independent Drives) or RAID-like data redundancy operations, compressing data, encrypting data, and so on.
- RAID Redundant Array of Independent Drives
- RAID-like data redundancy operations compressing data, encrypting data, and so on.
- Each storage array controller ( 106 , 112 ) may also include, for example, an I/O controller or the like that couples the storage array controller ( 106 , 112 ) for data communications, through a midplane ( 114 ), to a number of storage devices ( 146 , 150 ), and a number of write buffer devices ( 148 , 152 ).
- Each write buffer device ( 148 , 152 ) may be configured to receive, from the storage array controller ( 106 , 112 ), data to be stored in the storage devices ( 146 ). Such data may originate from any one of the computing devices ( 164 , 166 , 168 , 170 ). In the example of FIG. 1 , writing data to the write buffer device ( 148 , 152 ) may be carried out more quickly than writing data to the storage device ( 146 , 150 ).
- the storage array controller ( 106 , 112 ) may be configured to effectively utilize the write buffer devices ( 148 , 152 ) as a quickly accessible buffer for data destined to be written to storage. In this way, the latency of write requests may be significantly improved relative to a system in which the storage array controller writes data directly to the storage devices ( 146 , 150 ).
- a ‘storage device’ as the term is used in this specification refers to any device configured to record data persistently.
- the term ‘persistently’ as used here refers to a device's ability to maintain recorded data after loss of a power source. Examples of storage devices may include mechanical, spinning hard disk drives, Solid-state drives (e.g., “Flash drives”), and the like.
- the storage array controllers ( 106 , 112 ) of FIG. 1 may be useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- the storage array controllers ( 106 , 112 ) may assist in intelligently compressing data by receiving an amount of processing resources available in the storage system, receiving an amount of space available in the storage system, and selecting a data compression algorithm to utilize to compress the data in dependence upon a priority for conserving the amount of processing resources and the amount of space, and performing other functions as will be described in greater detail below.
- FIG. 1 The arrangement of computing devices, storage arrays, networks, and other devices making up the example system illustrated in FIG. 1 are for explanation, not for limitation.
- Systems useful according to various embodiments of the present disclosure may include different configurations of servers, routers, switches, computing devices, and network architectures, not shown in FIG. 1 , as will occur to those of skill in the art.
- FIG. 2 sets forth a block diagram of a storage array controller ( 202 ) useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.
- the storage array controller ( 202 ) of FIG. 2 is similar to the storage array controllers depicted in FIG. 1 , as the storage array controller ( 202 ) of FIG. 2 is communicatively coupled, via a midplane ( 206 ), to one or more storage devices ( 212 ) and to one or more memory buffer devices ( 214 ) that are included as part of a storage array ( 216 ).
- the storage array controller ( 202 ) may be coupled to the midplane ( 206 ) via one or more data communications links ( 204 ) and the midplane ( 206 ) may be coupled to the storage devices ( 212 ) and the memory buffer devices ( 214 ) via one or more data communications links ( 208 , 210 ).
- the data communications links ( 204 , 208 , 210 ) of FIG. 2 may be embodied, for example, as Peripheral Component Interconnect Express (‘PCIe’) bus.
- PCIe Peripheral Component Interconnect Express
- the storage array controller ( 202 ) of FIG. 2 includes at least one computer processor ( 232 ) or ‘CPU’ as well as random access memory (‘RAM’) ( 236 ).
- the computer processor ( 232 ) may be connected to the RAM ( 236 ) via a data communications link ( 230 ), which may be embodied as a high speed memory bus such as a Double-Data Rate 4 (‘DDR4’) bus.
- DDR4 Double-Data Rate 4
- RAM ( 214 ) Stored in RAM ( 214 ) is an operating system ( 246 ). Examples of operating systems useful in storage array controllers ( 202 ) configured for intelligently compressing data in a storage array according to embodiments of the present disclosure include UNIXTM, LinuxTM, Microsoft WindowsTM, and others as will occur to those of skill in the art. Also stored in RAM ( 236 ) is a compression optimization module ( 248 ), a module that includes computer program instructions useful in compressing data in dependence upon characteristics of a storage system that includes a plurality of storage devices according to embodiments of the present disclosure.
- the compression optimization module ( 248 ) may compress data in dependence upon characteristics of a storage system by: receiving an amount of processing resources available in the storage system, receiving an amount of space available in the storage system, and selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space, a data compression algorithm to utilize to compress the data, as will be described in greater detail below.
- the compression optimization module ( 248 ) may further intelligently compress data in a storage array that includes a plurality of storage devices by: determining an expected amount of space in the storage system to be consumed within a predetermined period of time, determining an expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm for each of a plurality of data compression algorithms, determining an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm for each of a plurality of data compression algorithms, determining, an expected decompression speed associated with decompressing the data for each of a plurality of data compression algorithms, determining an average decompression speed associated with decompressing a pool of data for each of a plurality of data compression algorithms, compressing at least a portion of the data utilizing a plurality of data compression algorithms, identifying a data reduction level achieved by each data compression algorithm, determining a decompression speed associated with each data compression algorithm, and selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each
- Each of the host bus adapters ( 218 , 220 , 222 ) may be coupled to the computer processor ( 232 ) via a data communications link ( 224 , 226 , 228 ) such as, for example, a PCIe bus.
- the storage array controller ( 202 ) of FIG. 2 also includes a host bus adapter ( 240 ) that is coupled to an expander ( 242 ).
- the expander ( 242 ) depicted in FIG. 2 may be embodied as a module of computer hardware utilized to attach a host system to a larger number of storage devices than would be possible without the expander ( 242 ).
- the expander ( 242 ) depicted in FIG. 2 may be embodied, for example, as a SAS expander utilized to enable the host bus adapter ( 240 ) to attach to storage devices in an embodiment where the host bus adapter ( 240 ) is embodied as a SAS controller.
- the storage array controller ( 202 ) of FIG. 2 also includes a switch ( 244 ) that is coupled to the computer processor ( 232 ) via a data communications link ( 238 ).
- the switch ( 244 ) of FIG. 2 may be embodied as a computer hardware device that can create multiple endpoints out of a single endpoint, thereby enabling multiple devices to share what was initially a single endpoint.
- the switch ( 244 ) of FIG. 2 may be embodied, for example, as a PCIe switch that is coupled to a PCIe bus ( 238 ) and presents multiple PCIe connection points to the midplane ( 206 ).
- the storage array controller ( 202 ) of FIG. 2 also includes a data communications link ( 234 ) for coupling the storage array controller ( 202 ) to other storage array controllers.
- a data communications link ( 234 ) may be embodied, for example, as a QuickPath Interconnect (‘QPI’) interconnect, as PCIe non-transparent bridge (‘NTB’) interconnect, and so on.
- QPI QuickPath Interconnect
- NTB PCIe non-transparent bridge
- FIG. 3 sets forth a flow chart illustrating an example method for compressing data in dependence upon characteristics of a storage system ( 300 ) according to embodiments of the present disclosure.
- the storage system ( 300 ) of FIG. 3 may be similar to the storage arrays described above with reference to FIG. 1 .
- the storage system ( 300 ) of FIG. 3 includes a plurality of storage devices ( 302 , 304 , 306 ), each of which may be used to store data ( 308 , 310 , 312 ).
- the example method depicted in FIG. 3 is carried out, at least in part, by a compression prioritization module ( 314 ).
- the compression prioritization module ( 314 ) may be embodied, for example, as a module of computer software executing on computer hardware such as a computer processor.
- the compression prioritization module ( 314 ) may be executing, for example, on a storage array controller such as the storage array controllers that are described above with reference to FIG. 1 and FIG. 2 .
- the example method depicted in FIG. 3 also includes receiving ( 316 ) an amount of processing resources ( 322 ) available in the storage system ( 300 ).
- the amount of processing resources ( 322 ) available in the storage system ( 300 ) may include, for example, a number of CPU processing cycles that are available per unit of time, a percentage of all of the CPU processing cycles that are available, an amount of memory that is available, and so on.
- the amount of processing resources ( 322 ) available in the storage system ( 300 ) may be determined based on historical information, based on the current load (e.g., the number of IOPS directed to the storage system) of the computing system ( 300 ) and the hardware resources of the computing system ( 300 ), based on any other indicia of the amount of processing resources ( 322 ) available in the storage system ( 300 ) that will occur to those of skill in the art in view of the teachings contained in this disclosure, or based on any combination thereof.
- the amount of processing resources ( 322 ) available in the storage system ( 300 ) may be speculatively determined based on past system performance, current system performance, or any combination thereof.
- the example method depicted in FIG. 3 also includes receiving ( 318 ) an amount of space ( 324 ) available in the storage system ( 300 ).
- the amount of space ( 324 ) available in the storage system ( 300 ) can represent the cumulative amount of available storage on the storage devices ( 302 , 304 , 306 ) in the storage system ( 300 ).
- the amount of space ( 324 ) available in the storage system ( 300 ) may be received ( 318 ) by the compression prioritization module ( 314 ), for example, by a resource monitoring module ( 326 ) that tracks resource utilization in the system, by the compression prioritization module ( 314 ) itself, or by any other module that is included in the storage system ( 300 ) or operable to otherwise manage the storage system ( 300 ).
- the amount of space ( 324 ) available in the storage system ( 300 ) is distinct from the amount of available memory that may be included as part of the amount of processing resources ( 322 ) available in the storage system ( 300 ).
- the amount of space ( 324 ) available in the storage system ( 300 ) represents the amount of long-term, persistent storage that is available within the storage devices ( 302 , 304 , 306 ) that are included in the storage system ( 300 ).
- the amount of space ( 324 ) that is available in the storage system ( 300 ) may include not only space that is available in the traditional sense, but also space that is currently in use but may be reclaimed through the use of one or more data reduction techniques such as garbage collection.
- the amount of available memory that may be included as part of the amount of processing resources ( 322 ) available in the storage system ( 300 ) represents short-term, possibly volatile, memory that is available for use in performing data compression operations.
- the amount of available memory that may be included as part of the amount of processing resources ( 322 ) available in the storage system ( 300 ) may be embodied, for example, as DRAM within a storage array controller such as the storage array controllers described above with reference to FIG. 1 and FIG. 2 .
- the priority is determined to be biased towards better utilization of processing resources then a compression algorithm which achieves this outcome will be selected.
- the amount of space may or may not be optimal in order to receive better utilization of processing resources. If the priority is determined to be biased towards better allocation of space then similarly a compression algorithm will be selected.
- the amount of processing resources may not be optimal at times and may also vary. In some circumstances, a proportional optimization or balance between the amount of processing resources and amount of space is desired. The priority is placed on achieving an objective towards conserving both processing resources and space. In all of these scenarios, one or more compression algorithms may be selected over a period of time. Conservation of processing resources and space could be embodied as improvements to usage (e.g., less compute, memory, etc.), better utilization (e.g., use of less space, balanced usage of processors, etc.), more efficient use of energy, and performance.
- Such a priority may be dynamic as the value changes over time and such a priority may be calculated based on additional factors and could change at different times.
- one factor that impacts the priority may be the current operating conditions of the system (e.g., processing resources currently available in the storage system, the amount of space currently available in the storage system, the rate at which consumption of each type of resource is accelerating or decelerating), another factor that impacts the priority may be historical operating conditions of the system (e.g., times and dates at which consumption of each type of resource spikes or decreases), another factor that impacts the priority could be system settings (e.g., a general preference to run out of processing resources rather than storage resources, or vice versa), and so on.
- the current operating conditions of the system e.g., processing resources currently available in the storage system, the amount of space currently available in the storage system, the rate at which consumption of each type of resource is accelerating or decelerating
- another factor that impacts the priority may be historical operating conditions of the system (e.g., times and dates at which consumption of
- selecting ( 320 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon a priority for conserving the amount of processing resources and the amount of space may be carried out, for example, by applying one or more predetermined formulas that utilizes a priority for conserving the amount of processing resources and the amount of space as an input.
- Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected ( 320 ).
- the predetermined formula may be configured to strike a balance between the amount of processing resources ( 322 ) available in the storage system ( 300 ) and the amount of space ( 324 ) available in the storage system. For example, when the amount of processing resources ( 322 ) available in the storage system ( 300 ) are relatively low, the compression prioritization module ( 314 ) may select ( 320 ) to compress the data ( 308 , 310 , 312 ) utilizing quick, lightweight compression algorithms that consume relatively small amounts of computing resources and also produce relatively small amounts of data reduction.
- the compression prioritization module ( 314 ) may select ( 320 ) to compress the data ( 308 , 310 , 312 ) slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction.
- the compression prioritization module ( 314 ) may select ( 320 ) to compress the data ( 308 , 310 , 312 ) using slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction, as a premium will be placed on data reduction rather than conservation of processing resources in such situations.
- the amount of space ( 324 ) available in the storage system is relatively high, a premium will be placed conserving processing resources rather than data reduction in such situations.
- FIG. 4 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system ( 300 ) according to embodiments of the present disclosure.
- the example method depicted in FIG. 4 is similar to the example method depicted in FIG. 3 , as the example method depicted in FIG.
- the 4 also includes receiving ( 316 ) an amount of processing resources ( 322 ) available in the storage system ( 300 ), receiving ( 318 ) an amount of space ( 324 ) available in the storage system ( 300 ), and selecting ( 320 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon the priority for conserving the amount of processing resources ( 322 ) and the amount of space ( 324 ).
- the example method depicted in FIG. 4 also includes determining ( 402 ) an expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within a predetermined period of time.
- the compression prioritization module ( 314 ) of FIG. 4 may determine ( 402 ) an expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within a predetermined period of time, for example, through the use of historical utilization information.
- the compression prioritization module ( 314 ) may determine that users of the storage system ( 300 ) will continue to consume storage within the storage system ( 300 ) at a rate of 1 GB/day. In such a way, the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within a predetermined period of time may be determined ( 402 ) by multiplying the rate at which storage within the storage system ( 300 ) has been consumed by the predetermined period of time.
- the compression prioritization module ( 314 ) may additionally be configured to identify trends in usage (e.g., that the rate at which storage is being consumed is increasing or decreasing at a specific rate) and may therefore factor such trends into such a determination ( 402 ). Readers will appreciate that determining ( 402 ) the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within a predetermined period of time may be carried out in additional ways utilizing historical information, real-time data, or any combination thereof.
- determining ( 402 ) the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within a predetermined period of time may be carried out by the compression prioritization module ( 314 ) receiving one or more messages describing the utilization of storage space within the storage system ( 300 ).
- the one or more messages describing the utilization of storage space within the storage system ( 300 ) may be received, for example, from a resource monitoring module ( 326 ) that tracks storage utilization in the storage system ( 300 ) or by any other module that is included in the storage system ( 300 ) or operable to otherwise manage the storage system ( 300 ).
- the utilization of storage space within the storage system ( 300 ) may be tracked by the compression prioritization module ( 314 ) itself.
- the data compression algorithm ( 328 ) to utilize is further selected ( 406 ) in dependence upon the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within the predetermined period of time.
- Selecting ( 406 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within the predetermined period of time may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within the predetermined period of time as an input.
- Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected ( 406 ).
- a data compression algorithm that can achieve higher levels of data reduction may be selected ( 406 ) even if such a data compression algorithm consumes relatively large amounts of processing resources, given that the available storage within the storage system ( 300 ) is being rapidly consumed.
- a data compression algorithm that consumes relatively small amounts of processing resources may be selected ( 406 ) even if such a data compression algorithm only achieves relatively small levels of data reduction, given that the available storage within the storage system ( 300 ) is not being rapidly consumed.
- data compression algorithms that achieve higher levels of data reduction may be selected ( 406 ) as the expected amount of space ( 404 ) in the storage system ( 300 ) to be consumed within the predetermined period of time increases, even if selecting such data compression algorithms requires a larger amount of processing resources to execute relative to data compression algorithms that achieve lower levels of data reduction.
- FIG. 5 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system ( 300 ) according to embodiments of the present disclosure.
- the example method depicted in FIG. 5 is similar to the example method depicted in FIG. 3 , as the example method depicted in FIG.
- 5 also includes receiving ( 316 ) an amount of processing resources ( 322 ) available in the storage system ( 300 ), receiving ( 318 ) an amount of space ( 324 ) available in the storage system ( 300 ), and selecting ( 320 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon the priority for conserving the amount of processing resources ( 322 ) and the amount of space ( 324 ).
- the example method depicted in FIG. 5 also includes determining ( 502 ), for each of a plurality of data compression algorithms, an expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm.
- the compression prioritization module ( 314 ) of FIG. 5 may determine ( 502 ) an expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm, for example, through the use of historical information gathered when previously compressing data. If the compression prioritization module ( 314 ) analyzes historical information gathered when previously compressing data to determine, for example, that a first compression algorithm requires 10,000 processing cycles to compress 1 GB of data, that a second compression algorithm requires 15,000 processing cycles to compress 1 GB of data, and that a third compression algorithm requires 25,000 processing cycles to compress 1 GB of data.
- the expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm may be determined ( 402 ) by multiplying the rate at which processing resources are historically used to compress data by the amount of data to be compressed.
- determining ( 502 ) the expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm may be carried out by the compression prioritization module ( 314 ) receiving one or more messages describing the historical performance of each data compression algorithm.
- the one or more messages describing the historical performance of each data compression algorithm may be received, for example, from a resource monitoring module ( 326 ) that tracks the performance of various compression algorithms or by any other module that is included in the storage system ( 300 ) or operable to otherwise manage the storage system ( 300 ).
- the historical performance of each data compression algorithm may be tracked by the compression prioritization module ( 314 ) itself.
- the data compression algorithm ( 328 ) to utilize is further selected ( 506 ) in dependence upon the expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm.
- Selecting ( 506 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon the expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of processing resources ( 504 ) to be consumed by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm as an input.
- Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected ( 506 ).
- such a data algorithm may be selected ( 506 ) even when the amount of processing resources ( 322 ) available in the storage system ( 300 ) is relatively low, as performing such data compression is less likely to prevent other consumers of processing resources from accessing such processing resources.
- data compression algorithms may be selected such that performing data compression does not cause other consumers of processing resources to be blocked from accessing such processing resources.
- FIG. 6 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system ( 300 ) according to embodiments of the present disclosure.
- the example method depicted in FIG. 6 is similar to the example method depicted in FIG. 3 , as the example method depicted in FIG.
- FIG. 6 also includes receiving ( 316 ) an amount of processing resources ( 322 ) available in the storage system ( 300 ), receiving ( 318 ) an amount of space ( 324 ) available in the storage system ( 300 ), and selecting ( 320 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon the priority for conserving the amount of processing resources ( 322 ) and the amount of space ( 324 ).
- the example method depicted in FIG. 6 also includes determining ( 602 ), for each of a plurality of data compression algorithms, an expected amount of data reduction ( 604 ) to be achieved by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm.
- the compression prioritization module ( 314 ) of FIG. 6 may determine ( 602 ) an expected amount of data reduction ( 604 ) to be achieved by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm, for example, through the use of historical information gathered when previously compressing data.
- the compression prioritization module ( 314 ) analyzes historical information gathered when previously compressing data to determine, for example, that a first compression algorithm historically achieves a data compression rate of 3:1, that a second compression algorithm historically achieves a data compression rate of 5:1, and that a third compression algorithm historically achieves a data compression rate of 8:1.
- the expected amount of data reduction ( 604 ) to be achieved by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm may be determined ( 602 ) by assuming that the amount of data to be compressed will be reduced in a manner that is consistent with the historical data compression rate achieved by the data compression algorithm.
- determining ( 602 ) the expected amount of data reduction ( 604 ) to be achieved by compressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm may be carried out by the compression prioritization module ( 314 ) receiving one or more messages describing the historical data compression rate achieved by each data compression algorithm.
- the one or more messages describing the historical data compression rate achieved by each data compression algorithm may be received, for example, from a resource monitoring module ( 326 ) that tracks the performance of various compression algorithms or by any other module that is included in the storage system ( 300 ) or operable to otherwise manage the storage system ( 300 ).
- the historical data compression rate achieved by each data compression algorithm may be tracked by the compression prioritization module ( 314 ) itself.
- the example method depicted in FIG. 7 also includes determining ( 702 ), for each of a plurality of data compression algorithms, an expected decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ).
- the compression prioritization module ( 314 ) of FIG. 7 may determine ( 702 ) the expected decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm, for example, by identifying attributes of the data ( 308 , 310 , 312 ) and analyzing historical information gathered when previously decompressing data with similar attributes.
- the attributes of the data can include information such as, for example, the type of application that initially wrote the data ( 308 , 310 , 312 ) to the storage system ( 300 ), the size of the data ( 308 , 310 , 312 ), and so on.
- the expected decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ) is specific to the actual data ( 308 , 310 , 312 ) stored on the storage system ( 300 ).
- the expected decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm may be determined ( 702 ) by assuming that the data ( 308 , 310 , 312 ) will be decompressed at a speed that is consistent with the historical decompression speed for similar data.
- the data compression algorithm ( 328 ) to utilize is further selected ( 706 ) in dependence upon the decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ).
- Selecting ( 706 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) in dependence upon the decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ) may be carried out, for example, by applying one or more predetermined formulas that utilizes the decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ) as an input.
- Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected ( 706 ).
- such a data compression algorithm may be selected ( 706 ) for data stored by applications that require relatively fast response times, even if utilizing such a data compression algorithm may result in relatively low levels of data reduction.
- data stored by applications that do not require relatively fast response times may be compressed utilizing data compression algorithms that deliver relatively high levels of data reduction, data compression algorithm that consume relatively low amounts of processing resources, and so on, even when the decompression speed ( 704 ) associated with decompressing the data ( 308 , 310 , 312 ) utilizing the data compression algorithm is relatively low.
- FIG. 8 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system ( 300 ) according to embodiments of the present disclosure.
- the example method depicted in FIG. 8 is similar to the example method depicted in FIG. 3 , as the example method depicted in FIG.
- the example method depicted in FIG. 8 also includes determining ( 802 ), for each of a plurality of data compression algorithms, an average decompression speed ( 804 ) associated with decompressing a pool of data.
- the compression prioritization module ( 314 ) of FIG. 8 may determine ( 802 ) the average decompression speed ( 804 ) associated with decompressing a pool of data, for example, by analyzing historical information gathered when previously decompressing data. In such a way, the average decompression speed ( 804 ) associated with decompressing a pool of data is not specific to the actual data ( 308 , 310 , 312 ) stored on the storage system ( 300 ).
- determining ( 802 ) average decompression speed ( 804 ) associated with decompressing a pool of data utilizing the data compression algorithm may be carried out by the compression prioritization module ( 314 ) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm.
- the one or more messages describing the historical decompression speed achieved by each data compression algorithm may be received, for example, from a resource monitoring module ( 326 ) that tracks the performance of various compression algorithms or by any other module that is included in the storage system ( 300 ) or operable to otherwise manage the storage system ( 300 ).
- the historical decompression speed achieved by each data compression algorithm may be tracked by the compression prioritization module ( 314 ) itself.
- FIG. 9 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system ( 300 ) according to embodiments of the present disclosure.
- the example method depicted in FIG. 9 is similar to the example method depicted in FIG. 3 , as the example method depicted in FIG.
- selecting ( 320 ) a data compression algorithm ( 328 ) to utilize to compress the data ( 308 , 310 , 312 ) can also include identifying ( 904 ) a data reduction level achieved by each data compression algorithm. Identifying ( 904 ) a data reduction level achieved by each data compression algorithm may be carried out, for example, by determining the original size of the portion of the data ( 308 , 310 , 312 ) that was compressed utilizing a particular data compression algorithm and also determining the size of the resultant compressed data that was produced utilizing the particular data compression algorithm.
- the attributes of the data can include information such as, for example, the type of application that initially wrote the data ( 308 , 310 , 312 ) to the storage system ( 300 ), the size of the data ( 308 , 310 , 312 ), and so on.
- the expected decompression speed associated with each data compression algorithm may be specific to the actual data ( 308 , 310 , 312 ) stored on the storage system ( 300 ).
- the expected decompression speed associated with each data compression algorithm may be determined ( 904 ) by assuming that the data ( 308 , 310 , 312 ) will be decompressed at a speed that is consistent with the historical decompression speed for similar data.
- a data compression algorithm ( 328 ) to utilize to compress data ( 308 , 310 , 312 ) is selected ( 320 ) based on combinations of factors not expressly identified above, including utilizing all of the factors described above to select a data compression algorithm ( 328 ) to utilize to compress data ( 308 , 310 , 312 ). In fact, such factors may be given equal or unequal consideration in various embodiments of the present disclosure.
- a data compression algorithm ( 328 ) to utilize to compress data ( 308 , 310 , 312 ) may be selected ( 320 ) in further dependence on additional factors as will occur to those of skill in the art in view of the present disclosure.
- Example embodiments of the present disclosure are described largely in the context of a fully functional computer system. Readers of skill in the art will recognize, however, that the present disclosure also may be embodied in a computer program product disposed upon computer readable media for use with any suitable data processing system.
- Such computer readable storage media may be any transitory or non-transitory media. Examples of such media include storage media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media also include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a computer program product.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System (AREA)
Abstract
Utilizing different data compression algorithms based on characteristics of a storage system, including: detecting that an availability of resources to a storage system for storing additional data in the storage system has changed; and based on the detection, selecting a data compression algorithm to utilize to compress data that is different compared to a previously selected data compression algorithm.
Description
- This is a continuation application for patent entitled to a filing date and claiming the benefit of earlier-filed U.S. Pat. No. 11,748,322, issued Sep. 5, 2023, which is a continuation of U.S. Pat. No. 11,392,565, issued Jul. 19, 2022, which is a continuation of U.S. Pat. No. 10,572,460, issued Feb. 25, 2020, each of which are herein incorporated by reference in their entirety.
-
FIG. 1 sets forth a block diagram of a storage system configured for compressing data in dependence upon characteristics of the storage system according to embodiments of the present disclosure. -
FIG. 2 sets forth a block diagram of a storage array controller useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 3 sets forth a flow chart illustrating an example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 4 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 5 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 6 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 7 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 8 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. -
FIG. 9 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. - Example methods, apparatuses, and products for compressing data in dependence upon characteristics of a storage system in accordance with the present disclosure are described with reference to the accompanying drawings, beginning with
FIG. 1 .FIG. 1 sets forth a block diagram of a storage system configured for compressing data in dependence upon characteristics of the storage system according to embodiments of the present disclosure. The storage system ofFIG. 1 includes a number of computing devices (164, 166, 168, 170). Such computing devices may be implemented in a number of different ways. For example, a computing device may be a server in a data center, a workstation, a personal computer, a notebook, or the like. - The computing devices (164, 166, 168, 170) in the example of
FIG. 1 are coupled for data communications to a number of storage arrays (102, 104) through a storage area network (‘SAN’) (158) as well as a local area network (160) (‘LAN’). The SAN (158) may be implemented with a variety of data communications fabrics, devices, and protocols. Example fabrics for such a SAN (158) may include Fibre Channel, Ethernet, Infiniband, Serial Attached Small Computer System Interface (‘SAS’), and the like. Example data communications protocols for use in such a SAN (158) may include Advanced Technology Attachment (‘ATA’), Fibre Channel Protocol, SCSI, iSCSI, HyperSCSI, and others. Readers of skill in the art will recognize that a SAN is just one among many possible data communications couplings which may be implemented between a computing device (164, 166, 168, 170) and a storage array (102, 104). For example, the storage devices (146, 150) within the storage arrays (102, 104) may also be coupled to the computing devices (164, 166, 168, 170) as network attached storage (‘NAS’) capable of facilitating file-level access, or even using a SAN-NAS hybrid that offers both file-level protocols and block-level protocols from the same system. Any other such data communications coupling is well within the scope of embodiments of the present disclosure. - The local area network (160) of
FIG. 1 may also be implemented with a variety of fabrics and protocols. Examples of such fabrics include Ethernet (802.3), wireless (802.11), and the like. Examples of such data communications protocols include Transmission Control Protocol (‘TCP’), User Datagram Protocol (‘UDP’), Internet Protocol (‘IP’), HyperText Transfer Protocol (‘HTTP’), Wireless Access Protocol (‘WAP’), Handheld Device Transport Protocol (‘HDTP’), Real Time Protocol (‘RTP’) and others as will occur to those of skill in the art. - The example storage arrays (102, 104) of
FIG. 1 provide persistent data storage for the computing devices (164, 166, 168, 170). Each storage array (102, 104) depicted inFIG. 1 includes a storage array controller (106, 112). Each storage array controller (106, 112) may be embodied as a module of automated computing machinery comprising computer hardware, computer software, or a combination of computer hardware and software. The storage array controllers (106, 112) may be configured to carry out various storage-related tasks. Such tasks may include writing data received from the one or more of the computing devices (164, 166, 168, 170) to storage, erasing data from storage, retrieving data from storage to provide the data to one or more of the computing devices (164, 166, 168, 170), monitoring and reporting of disk utilization and performance, performing RAID (Redundant Array of Independent Drives) or RAID-like data redundancy operations, compressing data, encrypting data, and so on. - Each storage array controller (106, 112) may be implemented in a variety of ways, including as a Field Programmable Gate Array (‘FPGA’), a Programmable Logic Chip (‘PLC’), an Application Specific Integrated Circuit (‘ASIC’), or computing device that includes discrete components such as a central processing unit, computer memory, and various adapters. Each storage array controller (106, 112) may include, for example, a data communications adapter configured to support communications via the SAN (158) and the LAN (160). Although only one of the storage array controllers (112) in the example of
FIG. 1 is depicted as being coupled to the LAN (160) for data communications, readers will appreciate that both storage array controllers (106, 112) may be independently coupled to the LAN (160). Each storage array controller (106, 112) may also include, for example, an I/O controller or the like that couples the storage array controller (106, 112) for data communications, through a midplane (114), to a number of storage devices (146, 150), and a number of write buffer devices (148, 152). - Each write buffer device (148, 152) may be configured to receive, from the storage array controller (106, 112), data to be stored in the storage devices (146). Such data may originate from any one of the computing devices (164, 166, 168, 170). In the example of
FIG. 1 , writing data to the write buffer device (148, 152) may be carried out more quickly than writing data to the storage device (146, 150). The storage array controller (106, 112) may be configured to effectively utilize the write buffer devices (148, 152) as a quickly accessible buffer for data destined to be written to storage. In this way, the latency of write requests may be significantly improved relative to a system in which the storage array controller writes data directly to the storage devices (146, 150). - A ‘storage device’ as the term is used in this specification refers to any device configured to record data persistently. The term ‘persistently’ as used here refers to a device's ability to maintain recorded data after loss of a power source. Examples of storage devices may include mechanical, spinning hard disk drives, Solid-state drives (e.g., “Flash drives”), and the like.
- The storage array controllers (106, 112) of
FIG. 1 may be useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. The storage array controllers (106, 112) may assist in intelligently compressing data by receiving an amount of processing resources available in the storage system, receiving an amount of space available in the storage system, and selecting a data compression algorithm to utilize to compress the data in dependence upon a priority for conserving the amount of processing resources and the amount of space, and performing other functions as will be described in greater detail below. - The arrangement of computing devices, storage arrays, networks, and other devices making up the example system illustrated in
FIG. 1 are for explanation, not for limitation. Systems useful according to various embodiments of the present disclosure may include different configurations of servers, routers, switches, computing devices, and network architectures, not shown inFIG. 1 , as will occur to those of skill in the art. - Compressing data in dependence upon characteristics of a storage system in accordance with embodiments of the present disclosure is generally implemented with computers. In the system of
FIG. 1 , for example, all the computing devices (164, 166, 168, 170) and storage controllers (106, 112) may be implemented to some extent at least as computers. For further explanation, therefore,FIG. 2 sets forth a block diagram of a storage array controller (202) useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. - The storage array controller (202) of
FIG. 2 is similar to the storage array controllers depicted inFIG. 1 , as the storage array controller (202) ofFIG. 2 is communicatively coupled, via a midplane (206), to one or more storage devices (212) and to one or more memory buffer devices (214) that are included as part of a storage array (216). The storage array controller (202) may be coupled to the midplane (206) via one or more data communications links (204) and the midplane (206) may be coupled to the storage devices (212) and the memory buffer devices (214) via one or more data communications links (208, 210). The data communications links (204, 208, 210) ofFIG. 2 may be embodied, for example, as Peripheral Component Interconnect Express (‘PCIe’) bus. - The storage array controller (202) of
FIG. 2 includes at least one computer processor (232) or ‘CPU’ as well as random access memory (‘RAM’) (236). The computer processor (232) may be connected to the RAM (236) via a data communications link (230), which may be embodied as a high speed memory bus such as a Double-Data Rate 4 (‘DDR4’) bus. - Stored in RAM (214) is an operating system (246). Examples of operating systems useful in storage array controllers (202) configured for intelligently compressing data in a storage array according to embodiments of the present disclosure include UNIX™, Linux™, Microsoft Windows™, and others as will occur to those of skill in the art. Also stored in RAM (236) is a compression optimization module (248), a module that includes computer program instructions useful in compressing data in dependence upon characteristics of a storage system that includes a plurality of storage devices according to embodiments of the present disclosure.
- The compression optimization module (248) may compress data in dependence upon characteristics of a storage system by: receiving an amount of processing resources available in the storage system, receiving an amount of space available in the storage system, and selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space, a data compression algorithm to utilize to compress the data, as will be described in greater detail below.
- The compression optimization module (248) may further intelligently compress data in a storage array that includes a plurality of storage devices by: determining an expected amount of space in the storage system to be consumed within a predetermined period of time, determining an expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm for each of a plurality of data compression algorithms, determining an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm for each of a plurality of data compression algorithms, determining, an expected decompression speed associated with decompressing the data for each of a plurality of data compression algorithms, determining an average decompression speed associated with decompressing a pool of data for each of a plurality of data compression algorithms, compressing at least a portion of the data utilizing a plurality of data compression algorithms, identifying a data reduction level achieved by each data compression algorithm, determining a decompression speed associated with each data compression algorithm, and selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm, as will be described in greater detail below.
- The storage array controller (202) of
FIG. 2 also includes a plurality of host bus adapters (218, 220, 222) that are coupled to the processor (232) via a data communications link (224, 226, 228). Each host bus adapter (218, 220, 222) may be embodied as a module of computer hardware that connects the host system (i.e., the storage array controller) to other network and storage devices. Each of the host bus adapters (218, 220, 222) ofFIG. 2 may be embodied, for example, as a Fibre Channel adapter that enables the storage array controller (202) to connect to a SAN, as an Ethernet adapter that enables the storage array controller (202) to connect to a LAN, and so on. Each of the host bus adapters (218, 220, 222) may be coupled to the computer processor (232) via a data communications link (224, 226, 228) such as, for example, a PCIe bus. - The storage array controller (202) of
FIG. 2 also includes a host bus adapter (240) that is coupled to an expander (242). The expander (242) depicted inFIG. 2 may be embodied as a module of computer hardware utilized to attach a host system to a larger number of storage devices than would be possible without the expander (242). The expander (242) depicted inFIG. 2 may be embodied, for example, as a SAS expander utilized to enable the host bus adapter (240) to attach to storage devices in an embodiment where the host bus adapter (240) is embodied as a SAS controller. - The storage array controller (202) of
FIG. 2 also includes a switch (244) that is coupled to the computer processor (232) via a data communications link (238). The switch (244) ofFIG. 2 may be embodied as a computer hardware device that can create multiple endpoints out of a single endpoint, thereby enabling multiple devices to share what was initially a single endpoint. The switch (244) ofFIG. 2 may be embodied, for example, as a PCIe switch that is coupled to a PCIe bus (238) and presents multiple PCIe connection points to the midplane (206). - The storage array controller (202) of
FIG. 2 also includes a data communications link (234) for coupling the storage array controller (202) to other storage array controllers. Such a data communications link (234) may be embodied, for example, as a QuickPath Interconnect (‘QPI’) interconnect, as PCIe non-transparent bridge (‘NTB’) interconnect, and so on. - Readers will recognize that these components, protocols, adapters, and architectures are for illustration only, not limitation. Such a storage array controller may be implemented in a variety of different ways, each of which is well within the scope of the present disclosure.
- For further explanation,
FIG. 3 sets forth a flow chart illustrating an example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. Although depicted in less detail, the storage system (300) ofFIG. 3 may be similar to the storage arrays described above with reference toFIG. 1 . The storage system (300) ofFIG. 3 includes a plurality of storage devices (302, 304, 306), each of which may be used to store data (308, 310, 312). - The example method depicted in
FIG. 3 is carried out, at least in part, by a compression prioritization module (314). The compression prioritization module (314) may be embodied, for example, as a module of computer software executing on computer hardware such as a computer processor. The compression prioritization module (314) may be executing, for example, on a storage array controller such as the storage array controllers that are described above with reference toFIG. 1 andFIG. 2 . - The example method depicted in
FIG. 3 also includes receiving (316) an amount of processing resources (322) available in the storage system (300). The amount of processing resources (322) available in the storage system (300) may include, for example, a number of CPU processing cycles that are available per unit of time, a percentage of all of the CPU processing cycles that are available, an amount of memory that is available, and so on. The amount of processing resources (322) available in the storage system (300) may be received (316), for example, by a resource monitoring module (326) that tracks resource utilization in the system, by the compression prioritization module (314) itself, or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Readers will appreciate that the amount of processing resources (322) available in the storage system (300) may be determined based on historical information, based on the current load (e.g., the number of IOPS directed to the storage system) of the computing system (300) and the hardware resources of the computing system (300), based on any other indicia of the amount of processing resources (322) available in the storage system (300) that will occur to those of skill in the art in view of the teachings contained in this disclosure, or based on any combination thereof. As such, the amount of processing resources (322) available in the storage system (300) may be speculatively determined based on past system performance, current system performance, or any combination thereof. - The example method depicted in
FIG. 3 also includes receiving (318) an amount of space (324) available in the storage system (300). The amount of space (324) available in the storage system (300) can represent the cumulative amount of available storage on the storage devices (302, 304, 306) in the storage system (300). The amount of space (324) available in the storage system (300) may be received (318) by the compression prioritization module (314), for example, by a resource monitoring module (326) that tracks resource utilization in the system, by the compression prioritization module (314) itself, or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). - Readers will appreciate that the amount of space (324) available in the storage system (300) is distinct from the amount of available memory that may be included as part of the amount of processing resources (322) available in the storage system (300). The amount of space (324) available in the storage system (300) represents the amount of long-term, persistent storage that is available within the storage devices (302, 304, 306) that are included in the storage system (300). The amount of space (324) that is available in the storage system (300) may include not only space that is available in the traditional sense, but also space that is currently in use but may be reclaimed through the use of one or more data reduction techniques such as garbage collection. In contrast to the amount of space (324) available in the storage system (300), the amount of available memory that may be included as part of the amount of processing resources (322) available in the storage system (300) represents short-term, possibly volatile, memory that is available for use in performing data compression operations. The amount of available memory that may be included as part of the amount of processing resources (322) available in the storage system (300) may be embodied, for example, as DRAM within a storage array controller such as the storage array controllers described above with reference to
FIG. 1 andFIG. 2 . Readers will appreciate that when a user of the storage system (300) initiates a request to write data, the data will ultimately be stored within the long-term, persistent storage that is available within the storage devices (302, 304, 306), not within the short-term, possibly volatile, memory that is available for use in performing data compression operations. - The example method depicted in
FIG. 3 also includes selecting (320), in dependence upon a priority for conserving the amount of processing resources and the amount of space, a data compression algorithm (328) to utilize to compress the data (308, 310, 312). Examples of data compression algorithms (328) that may be utilized to compress the data can include Lempel-Ziv algorithms, Burrows-Wheeler transform algorithms, dictionary coder algorithms, and many others. The priority for conserving the amount of processing resources and the amount of space may be embodied, for example, as a quantifiable value that represents a preference for conserving processing resources relative to conserving storage resources. For example, the priority may be a level, percentage, or a number representing a balance between processing resources and space. If the priority is determined to be biased towards better utilization of processing resources then a compression algorithm which achieves this outcome will be selected. In this scenario, the amount of space may or may not be optimal in order to receive better utilization of processing resources. If the priority is determined to be biased towards better allocation of space then similarly a compression algorithm will be selected. In this scenario, the amount of processing resources may not be optimal at times and may also vary. In some circumstances, a proportional optimization or balance between the amount of processing resources and amount of space is desired. The priority is placed on achieving an objective towards conserving both processing resources and space. In all of these scenarios, one or more compression algorithms may be selected over a period of time. Conservation of processing resources and space could be embodied as improvements to usage (e.g., less compute, memory, etc.), better utilization (e.g., use of less space, balanced usage of processors, etc.), more efficient use of energy, and performance. - Such a priority may be dynamic as the value changes over time and such a priority may be calculated based on additional factors and could change at different times. For example, one factor that impacts the priority may be the current operating conditions of the system (e.g., processing resources currently available in the storage system, the amount of space currently available in the storage system, the rate at which consumption of each type of resource is accelerating or decelerating), another factor that impacts the priority may be historical operating conditions of the system (e.g., times and dates at which consumption of each type of resource spikes or decreases), another factor that impacts the priority could be system settings (e.g., a general preference to run out of processing resources rather than storage resources, or vice versa), and so on.
- In the example method depicted in
FIG. 3 , selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon a priority for conserving the amount of processing resources and the amount of space may be carried out, for example, by applying one or more predetermined formulas that utilizes a priority for conserving the amount of processing resources and the amount of space as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (320). - Readers will appreciate that the predetermined formula may be configured to strike a balance between the amount of processing resources (322) available in the storage system (300) and the amount of space (324) available in the storage system. For example, when the amount of processing resources (322) available in the storage system (300) are relatively low, the compression prioritization module (314) may select (320) to compress the data (308, 310, 312) utilizing quick, lightweight compression algorithms that consume relatively small amounts of computing resources and also produce relatively small amounts of data reduction. Alternatively, when the amount of processing resources (322) available in the storage system (300) are relatively large, the compression prioritization module (314) may select (320) to compress the data (308, 310, 312) slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction. When the amount of space (324) available in the storage system is relatively low, however, the compression prioritization module (314) may select (320) to compress the data (308, 310, 312) using slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction, as a premium will be placed on data reduction rather than conservation of processing resources in such situations. Alternatively, when the amount of space (324) available in the storage system is relatively high, a premium will be placed conserving processing resources rather than data reduction in such situations.
- For further explanation,
FIG. 4 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted inFIG. 4 is similar to the example method depicted inFIG. 3 , as the example method depicted inFIG. 4 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324). - The example method depicted in
FIG. 4 also includes determining (402) an expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time. The compression prioritization module (314) ofFIG. 4 may determine (402) an expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time, for example, through the use of historical utilization information. If the compression prioritization module (314) analyzes historical utilization information to determine, for example, that 30 GB of storage within the storage system (300) has been consumed within the last 30 days, the compression prioritization module (314) may determine that users of the storage system (300) will continue to consume storage within the storage system (300) at a rate of 1 GB/day. In such a way, the expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time may be determined (402) by multiplying the rate at which storage within the storage system (300) has been consumed by the predetermined period of time. The compression prioritization module (314) may additionally be configured to identify trends in usage (e.g., that the rate at which storage is being consumed is increasing or decreasing at a specific rate) and may therefore factor such trends into such a determination (402). Readers will appreciate that determining (402) the expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time may be carried out in additional ways utilizing historical information, real-time data, or any combination thereof. - In the example method depicted in
FIG. 4 , determining (402) the expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time may be carried out by the compression prioritization module (314) receiving one or more messages describing the utilization of storage space within the storage system (300). The one or more messages describing the utilization of storage space within the storage system (300) may be received, for example, from a resource monitoring module (326) that tracks storage utilization in the storage system (300) or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the utilization of storage space within the storage system (300) may be tracked by the compression prioritization module (314) itself. - In the example method depicted in
FIG. 4 , the data compression algorithm (328) to utilize is further selected (406) in dependence upon the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time. Selecting (406) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (406). - Readers will appreciate that when the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time is relatively high, a data compression algorithm that can achieve higher levels of data reduction may be selected (406) even if such a data compression algorithm consumes relatively large amounts of processing resources, given that the available storage within the storage system (300) is being rapidly consumed. Alternatively, when the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time is relatively low, a data compression algorithm that consumes relatively small amounts of processing resources may be selected (406) even if such a data compression algorithm only achieves relatively small levels of data reduction, given that the available storage within the storage system (300) is not being rapidly consumed. In such a way, data compression algorithms that achieve higher levels of data reduction may be selected (406) as the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time increases, even if selecting such data compression algorithms requires a larger amount of processing resources to execute relative to data compression algorithms that achieve lower levels of data reduction.
- For further explanation,
FIG. 5 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted inFIG. 5 is similar to the example method depicted inFIG. 3 , as the example method depicted inFIG. 5 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324). - The example method depicted in
FIG. 5 also includes determining (502), for each of a plurality of data compression algorithms, an expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm. - The compression prioritization module (314) of
FIG. 5 may determine (502) an expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm, for example, through the use of historical information gathered when previously compressing data. If the compression prioritization module (314) analyzes historical information gathered when previously compressing data to determine, for example, that a first compression algorithm requires 10,000 processing cycles to compress 1 GB of data, that a second compression algorithm requires 15,000 processing cycles to compress 1 GB of data, and that a third compression algorithm requires 25,000 processing cycles to compress 1 GB of data. In such a way, the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm may be determined (402) by multiplying the rate at which processing resources are historically used to compress data by the amount of data to be compressed. - In the example method depicted in
FIG. 5 , determining (502) the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical performance of each data compression algorithm. The one or more messages describing the historical performance of each data compression algorithm may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical performance of each data compression algorithm may be tracked by the compression prioritization module (314) itself. - In the example method depicted in
FIG. 5 , the data compression algorithm (328) to utilize is further selected (506) in dependence upon the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm. Selecting (506) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (506). - Readers will appreciate that when the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing a particular data compression algorithm is relatively high, such a data compression algorithm may only be selected (506) when the amount of processing resources (322) available in the storage system (300) is also relatively high, in order to avoid performing resource intensive compression when other consumers of processing resources are demanding a relatively high amount of processing resources.
- Alternatively, when the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing a particular data compression algorithm is relatively low, such a data algorithm may be selected (506) even when the amount of processing resources (322) available in the storage system (300) is relatively low, as performing such data compression is less likely to prevent other consumers of processing resources from accessing such processing resources. In such a way, data compression algorithms may be selected such that performing data compression does not cause other consumers of processing resources to be blocked from accessing such processing resources.
- For further explanation,
FIG. 6 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted inFIG. 6 is similar to the example method depicted inFIG. 3 , as the example method depicted inFIG. 6 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324). - The example method depicted in
FIG. 6 also includes determining (602), for each of a plurality of data compression algorithms, an expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm. The compression prioritization module (314) ofFIG. 6 may determine (602) an expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm, for example, through the use of historical information gathered when previously compressing data. If the compression prioritization module (314) analyzes historical information gathered when previously compressing data to determine, for example, that a first compression algorithm historically achieves a data compression rate of 3:1, that a second compression algorithm historically achieves a data compression rate of 5:1, and that a third compression algorithm historically achieves a data compression rate of 8:1. In such a way, the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm may be determined (602) by assuming that the amount of data to be compressed will be reduced in a manner that is consistent with the historical data compression rate achieved by the data compression algorithm. - In the example method depicted in
FIG. 6 , determining (602) the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical data compression rate achieved by each data compression algorithm. The one or more messages describing the historical data compression rate achieved by each data compression algorithm may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical data compression rate achieved by each data compression algorithm may be tracked by the compression prioritization module (314) itself. - In the example method depicted in
FIG. 6 , the data compression algorithm (328) to utilize is further selected (606) in dependence upon the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm. Selecting (606) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (606). - Readers will appreciate that when the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm is relatively high, such a data compression algorithm may be selected (606) when the amount of free space within the storage system (300) is relatively low, even if executing such a data compression algorithm consumes relatively large amounts of processing resources.
- Alternatively, when the amount of free space within the storage system (300) is relatively high, less emphasis may be placed on selecting (606) a data compression algorithm whose expected amount of data reduction (604) is relatively high.
- For further explanation,
FIG. 7 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted inFIG. 7 is similar to the example method depicted inFIG. 3 , as the example method depicted inFIG. 7 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324). - The example method depicted in
FIG. 7 also includes determining (702), for each of a plurality of data compression algorithms, an expected decompression speed (704) associated with decompressing the data (308, 310, 312). The compression prioritization module (314) ofFIG. 7 may determine (702) the expected decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm, for example, by identifying attributes of the data (308, 310, 312) and analyzing historical information gathered when previously decompressing data with similar attributes. The attributes of the data can include information such as, for example, the type of application that initially wrote the data (308, 310, 312) to the storage system (300), the size of the data (308, 310, 312), and so on. In such a way, the expected decompression speed (704) associated with decompressing the data (308, 310, 312) is specific to the actual data (308, 310, 312) stored on the storage system (300). The expected decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm may be determined (702) by assuming that the data (308, 310, 312) will be decompressed at a speed that is consistent with the historical decompression speed for similar data. - In the example method depicted in
FIG. 7 , determining (702) the expected decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data. The one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical decompression speed achieved by each data compression algorithm for different types of data may be tracked by the compression prioritization module (314) itself. - In the example method depicted in
FIG. 7 , the data compression algorithm (328) to utilize is further selected (706) in dependence upon the decompression speed (704) associated with decompressing the data (308, 310, 312). Selecting (706) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the decompression speed (704) associated with decompressing the data (308, 310, 312) may be carried out, for example, by applying one or more predetermined formulas that utilizes the decompression speed (704) associated with decompressing the data (308, 310, 312) as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (706). - Readers will appreciate that when the decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm is relatively high, such a data compression algorithm may be selected (706) for data stored by applications that require relatively fast response times, even if utilizing such a data compression algorithm may result in relatively low levels of data reduction. Alternatively, data stored by applications that do not require relatively fast response times may be compressed utilizing data compression algorithms that deliver relatively high levels of data reduction, data compression algorithm that consume relatively low amounts of processing resources, and so on, even when the decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm is relatively low.
- For further explanation,
FIG. 8 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted inFIG. 8 is similar to the example method depicted inFIG. 3 , as the example method depicted inFIG. 8 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324). - The example method depicted in
FIG. 8 also includes determining (802), for each of a plurality of data compression algorithms, an average decompression speed (804) associated with decompressing a pool of data. The compression prioritization module (314) ofFIG. 8 may determine (802) the average decompression speed (804) associated with decompressing a pool of data, for example, by analyzing historical information gathered when previously decompressing data. In such a way, the average decompression speed (804) associated with decompressing a pool of data is not specific to the actual data (308, 310, 312) stored on the storage system (300). The average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm may be determined (802) by assuming that the data (308, 310, 312) will be decompressed at a speed that is consistent with the historical decompression speed for the data compression algorithm. - In the example method depicted in
FIG. 8 , determining (802) average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm. The one or more messages describing the historical decompression speed achieved by each data compression algorithm may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical decompression speed achieved by each data compression algorithm may be tracked by the compression prioritization module (314) itself. - In the example method depicted in
FIG. 8 , the data compression algorithm (328) to utilize is further selected (806) in dependence upon the average decompression speed (804) associated with decompressing a pool of data. Selecting (806) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the average decompression speed (804) associated with decompressing a pool of data may be carried out, for example, by applying one or more predetermined formulas that utilizes the average decompression speed (804) associated with decompressing a pool of data as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (806). - Readers will appreciate that when the average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm is relatively high, such a data compression algorithm may be selected (806) for data stored by applications that require relatively fast response times, even if utilizing such a data compression algorithm may result in relatively low levels of data reduction. Alternatively, data stored by applications that do not require relatively fast response times may be compressed utilizing data compression algorithms that deliver relatively high levels of data reduction, data compression algorithm that consume relatively low amounts of processing resources, and so on, even when average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm is relatively low.
- For further explanation,
FIG. 9 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted inFIG. 9 is similar to the example method depicted inFIG. 3 , as the example method depicted inFIG. 9 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324). - In the example method depicted in
FIG. 9 , selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can include compressing (902) at least a portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms. Compressing (902) at least a portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms may be carried out, for example, by compressing the same portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms. Alternatively, compressing (902) at least a portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms may be carried out by compressing a first portion of the data (308, 310, 312) utilizing a first data compression algorithm, compressing a second portion of the data (308, 310, 312) utilizing a second data compression algorithm, compressing a third portion of the data (308, 310, 312) utilizing a third data compression algorithm, and so on. - In the example method depicted in
FIG. 9 , selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can also include identifying (904) a data reduction level achieved by each data compression algorithm. Identifying (904) a data reduction level achieved by each data compression algorithm may be carried out, for example, by determining the original size of the portion of the data (308, 310, 312) that was compressed utilizing a particular data compression algorithm and also determining the size of the resultant compressed data that was produced utilizing the particular data compression algorithm. For example, if the original size of the portion of the data (308, 310, 312) that was compressed utilizing a first data compression algorithm was 1 MB and the size of the resultant compressed data that was produced utilizing the first data compression algorithm was 0.2 MB, the data reduction level achieved by the first data compression algorithm would be 5:1. Such a calculation may be made for each data compression algorithm that was utilized to compress (902) at least a portion of the data (308, 310, 312), such that the data reduction level achieved by each data compression algorithm may be identified (904). - In the example method depicted in
FIG. 9 , selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can also include determining (906) an expected decompression speed associated with each data compression algorithm. The compression prioritization module (314) ofFIG. 9 may determine (906) the expected decompression speed associated with each data compression algorithm, for example, by identifying attributes of the data (308, 310, 312) and analyzing historical information gathered when previously decompressing data with similar attributes. The attributes of the data can include information such as, for example, the type of application that initially wrote the data (308, 310, 312) to the storage system (300), the size of the data (308, 310, 312), and so on. In such a way, the expected decompression speed associated with each data compression algorithm may be specific to the actual data (308, 310, 312) stored on the storage system (300). The expected decompression speed associated with each data compression algorithm may be determined (904) by assuming that the data (308, 310, 312) will be decompressed at a speed that is consistent with the historical decompression speed for similar data. - In the example method depicted in
FIG. 9 , determining (906) an expected decompression speed associated with each data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data. The one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms, by the compression prioritization module (314) itself, or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). - In the example method depicted in
FIG. 9 , selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can also include selecting (908) the data compression algorithm to utilize to compress the data (308, 310, 312) in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm. Selecting (908) the data compression algorithm to utilize to compress the data (308, 310, 312) in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm may be carried out, for example, by applying a predetermined formula that utilizes the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm as inputs. Readers will appreciate that the predetermined formula may be configured to strike a balance between the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm. For example, when the amount of space (324) available in the storage system is relatively low, the compression prioritization module (314) may select (908) to compress the data (308, 310, 312) using slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction, as a premium will be placed on data reduction rather than conservation of processing resources as the amount of space available in the storage system is reduced. Alternatively, when the amount of space (324) available in the storage system is relatively high, a premium may be placed increasing response times to I/O operations and, as such, data compression algorithms that achieve faster decompression speeds may be selected (908). - In the example embodiments described above, a data compression algorithm (328) to utilize to compress data (308, 310, 312) is selected (320) based on factors such as (but not limited to): the priority for conserving the amount of processing resources (322) and the amount of space (324); the amount of processing resources available in the storage system; the amount of space available in the storage system; the expected amount of space in the storage system to be consumed within a predetermined period of time; the expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm; the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; the expected decompression speed associated with decompressing the data; and the average decompression speed associated with decompressing a pool of data. While the example embodiments described above typically describe selecting a data compression algorithm (328) to utilize to compress data (308, 310, 312) based on only a small subset of such factors, such a description is included only for ease of explanation. Readers will appreciate that embodiments are contemplated where a data compression algorithm (328) to utilize to compress data (308, 310, 312) is selected (320) based on combinations of factors not expressly identified above, including utilizing all of the factors described above to select a data compression algorithm (328) to utilize to compress data (308, 310, 312). In fact, such factors may be given equal or unequal consideration in various embodiments of the present disclosure. Furthermore, a data compression algorithm (328) to utilize to compress data (308, 310, 312) may be selected (320) in further dependence on additional factors as will occur to those of skill in the art in view of the present disclosure.
- Example embodiments of the present disclosure are described largely in the context of a fully functional computer system. Readers of skill in the art will recognize, however, that the present disclosure also may be embodied in a computer program product disposed upon computer readable media for use with any suitable data processing system. Such computer readable storage media may be any transitory or non-transitory media. Examples of such media include storage media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media also include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a computer program product. Persons skilled in the art will recognize also that, although some of the example embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware, as hardware, or as an aggregation of hardware and software are well within the scope of embodiments of the present disclosure.
- It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present disclosure without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present disclosure is limited only by the language of the following claims.
Claims (20)
1. A method comprising:
detecting that an availability of resources to a storage system for storing additional data in the storage system has changed; and
based on the detection, selecting a data compression algorithm to utilize to compress data that is different compared to a previously selected data compression algorithm.
2. The method of claim 1 , further comprising selecting the data compression algorithm based on a change in an availability of processing resources or an availability of storage resources.
3. The method of claim 1 , further comprising selecting a different data compression algorithm based on a priority for conserving processing resources or storage resources.
4. The method of claim 1 further comprising:
determining, for each of a plurality of data compression algorithms, an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; and
wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm.
5. The method of claim 1 further comprising:
determining, for each of a plurality of data compression algorithms, an expected decompression speed associated with decompressing the data; and
wherein the data compression algorithm to utilize is further selected in dependence upon the expected decompression speed associated with decompressing the data.
6. The method of claim 1 further comprising:
determining, for each of a plurality of data compression algorithms, an average decompression speed associated with decompressing a pool of data; and
wherein the data compression algorithm to utilize is further selected in dependence upon the average decompression speed associated with decompressing a pool of data.
7. The method of claim 1 wherein selecting the data compression algorithm to utilize to compress the data further comprises:
compressing at least a portion of the data utilizing a plurality of data compression algorithms;
identifying a data reduction level achieved by each data compression algorithm;
determining a decompression speed associated with each data compression algorithm; and
selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm.
8. An apparatus, the apparatus including a computer processor and a computer memory, the computer memory including computer program instructions that, when executed, cause the apparatus to carry out the steps of:
detecting that an availability of resources to a storage system for storing additional data in the storage system has changed; and
based on the detection, selecting a data compression algorithm to utilize to compress data that is different compared to a previously selected data compression algorithm.
9. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
selecting the data compression algorithm based on a change in an availability of processing resources or an availability of storage resources.
10. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
selecting a different data compression algorithm based on a priority for conserving processing resources or storage resources.
11. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
determining, for each of a plurality of data compression algorithms, an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; and
wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm.
12. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
determining, for each of a plurality of data compression algorithms, an expected decompression speed associated with decompressing the data; and
wherein the data compression algorithm to utilize is further selected in dependence upon the expected decompression speed associated with decompressing the data.
13. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
determining, for each of a plurality of data compression algorithms, an average decompression speed associated with decompressing a pool of data; and
wherein the data compression algorithm to utilize is further selected in dependence upon the average decompression speed associated with decompressing a pool of data.
14. The apparatus of claim 8 wherein selecting the data compression algorithm to utilize to compress the data further comprises:
compressing at least a portion of the data utilizing a plurality of data compression algorithms;
identifying a data reduction level achieved by each data compression algorithm;
determining a decompression speed associated with each data compression algorithm; and
selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm.
15. A computer program product, the computer program product disposed on a non-transitory computer readable storage medium, the computer program product comprising computer program instructions that, when executed, cause an apparatus to carry out the steps of:
detecting that an availability of resources to a storage system for storing additional data in the storage system has changed; and
based on the detection, selecting a data compression algorithm to utilize to compress data that is different compared to a previously selected data compression algorithm.
16. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
selecting the data compression algorithm based on a change in an availability of processing resources or an availability of storage resources.
17. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
selecting a different data compression algorithm based on a priority for conserving processing resources or storage resources.
18. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
determining, for each of a plurality of data compression algorithms, an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; and
wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm.
19. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
determining, for each of a plurality of data compression algorithms, an expected decompression speed associated with decompressing the data; and
wherein the data compression algorithm to utilize is further selected in dependence upon the expected decompression speed associated with decompressing the data.
20. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
determining, for each of a plurality of data compression algorithms, an average decompression speed associated with decompressing a pool of data; and
wherein the data compression algorithm to utilize is further selected in dependence upon the average decompression speed associated with decompressing a pool of data.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US18/457,978 US20230409546A1 (en) | 2016-02-11 | 2023-08-29 | Compression Algorithm Based On Resource Availability |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/041,307 US10572460B2 (en) | 2016-02-11 | 2016-02-11 | Compressing data in dependence upon characteristics of a storage system |
US16/743,024 US11392565B1 (en) | 2016-02-11 | 2020-01-15 | Optimizing data compression in a storage system |
US17/807,447 US11748322B2 (en) | 2016-02-11 | 2022-06-17 | Utilizing different data compression algorithms based on characteristics of a storage system |
US18/457,978 US20230409546A1 (en) | 2016-02-11 | 2023-08-29 | Compression Algorithm Based On Resource Availability |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/807,447 Continuation US11748322B2 (en) | 2016-02-11 | 2022-06-17 | Utilizing different data compression algorithms based on characteristics of a storage system |
Publications (1)
Publication Number | Publication Date |
---|---|
US20230409546A1 true US20230409546A1 (en) | 2023-12-21 |
Family
ID=57288516
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/041,307 Active 2037-05-22 US10572460B2 (en) | 2016-02-11 | 2016-02-11 | Compressing data in dependence upon characteristics of a storage system |
US16/743,024 Active 2036-07-26 US11392565B1 (en) | 2016-02-11 | 2020-01-15 | Optimizing data compression in a storage system |
US17/807,447 Active US11748322B2 (en) | 2016-02-11 | 2022-06-17 | Utilizing different data compression algorithms based on characteristics of a storage system |
US18/457,978 Pending US20230409546A1 (en) | 2016-02-11 | 2023-08-29 | Compression Algorithm Based On Resource Availability |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/041,307 Active 2037-05-22 US10572460B2 (en) | 2016-02-11 | 2016-02-11 | Compressing data in dependence upon characteristics of a storage system |
US16/743,024 Active 2036-07-26 US11392565B1 (en) | 2016-02-11 | 2020-01-15 | Optimizing data compression in a storage system |
US17/807,447 Active US11748322B2 (en) | 2016-02-11 | 2022-06-17 | Utilizing different data compression algorithms based on characteristics of a storage system |
Country Status (3)
Country | Link |
---|---|
US (4) | US10572460B2 (en) |
EP (1) | EP3414652A1 (en) |
WO (1) | WO2017138990A1 (en) |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9596126B2 (en) | 2013-10-10 | 2017-03-14 | Nicira, Inc. | Controller side method of generating and updating a controller assignment list |
US10572460B2 (en) | 2016-02-11 | 2020-02-25 | Pure Storage, Inc. | Compressing data in dependence upon characteristics of a storage system |
US10922286B2 (en) * | 2016-04-26 | 2021-02-16 | UMBRA Technologies Limited | Network Slinghop via tapestry slingshot |
US10585856B1 (en) * | 2016-06-28 | 2020-03-10 | EMC IP Holding Company LLC | Utilizing data access patterns to determine compression block size in data storage systems |
US11184327B2 (en) * | 2018-07-05 | 2021-11-23 | Vmware, Inc. | Context aware middlebox services at datacenter edges |
US10999220B2 (en) | 2018-07-05 | 2021-05-04 | Vmware, Inc. | Context aware middlebox services at datacenter edge |
GB2585513B (en) * | 2018-08-09 | 2021-06-23 | Memoscale As | Data compression |
US11641305B2 (en) | 2019-12-16 | 2023-05-02 | Vmware, Inc. | Network diagnosis in software-defined networking (SDN) environments |
JP7390251B2 (en) | 2020-04-30 | 2023-12-01 | 株式会社日立製作所 | storage system |
Family Cites Families (216)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5191548A (en) * | 1990-03-14 | 1993-03-02 | C-Cube Microsystems | System for compression and decompression of video data using discrete cosine transform and coding techniques |
US5686961A (en) * | 1992-01-27 | 1997-11-11 | Harris Corporation | Automatic video image data reduction and prioritization system and method |
US5918225A (en) * | 1993-04-16 | 1999-06-29 | Sybase, Inc. | SQL-based database system with improved indexing methodology |
US5651133A (en) | 1995-02-01 | 1997-07-22 | Hewlett-Packard Company | Methods for avoiding over-commitment of virtual capacity in a redundant hierarchic data storage system |
JPH08242229A (en) | 1995-03-01 | 1996-09-17 | Fujitsu Ltd | State matching processing system for monitoring network |
US6393584B1 (en) * | 1995-04-26 | 2002-05-21 | International Business Machines Corporation | Method and system for efficiently saving the operating state of a data processing system |
US5799200A (en) | 1995-09-28 | 1998-08-25 | Emc Corporation | Power failure responsive apparatus and method having a shadow dram, a flash ROM, an auxiliary battery, and a controller |
US6012032A (en) | 1995-11-30 | 2000-01-04 | Electronic Data Systems Corporation | System and method for accounting of computer data storage utilization |
US6038571A (en) * | 1996-01-31 | 2000-03-14 | Kabushiki Kaisha Toshiba | Resource management method and apparatus for information processing system of multitasking facility |
US7123718B1 (en) * | 1999-03-24 | 2006-10-17 | Blue Spike, Inc. | Utilizing data reduction in stegnographic and cryptographic systems |
US5933598A (en) | 1996-07-17 | 1999-08-03 | Digital Equipment Corporation | Method for sharing variable-grained memory of workstations by sending particular block including line and size of the block to exchange shared data structures |
US6085333A (en) | 1997-12-19 | 2000-07-04 | Lsi Logic Corporation | Method and apparatus for synchronization of code in redundant controllers in a swappable environment |
US6731723B1 (en) * | 1998-09-29 | 2004-05-04 | Skyworks Solutions, Inc. | Multi-line recording device having reduced processing and storage requirements |
US6647514B1 (en) | 2000-03-23 | 2003-11-11 | Hewlett-Packard Development Company, L.P. | Host I/O performance and availability of a storage array during rebuild by prioritizing I/O request |
US6643641B1 (en) | 2000-04-27 | 2003-11-04 | Russell Snyder | Web search engine with graphic snapshots |
JP2002041305A (en) | 2000-07-26 | 2002-02-08 | Hitachi Ltd | Allocating method of computer resource in virtual computer system, and virtual computer system |
US6789162B1 (en) | 2000-10-17 | 2004-09-07 | Sun Microsystems, Inc. | Storage controller configured to select unused regions of a storage device for data storage according to head position |
EP1402388A4 (en) * | 2001-06-04 | 2005-03-16 | Nct Group Inc | System and method for modifying a data stream using element parsing |
US7024414B2 (en) * | 2001-08-06 | 2006-04-04 | Sensage, Inc. | Storage of row-column data |
US20030056146A1 (en) * | 2001-09-14 | 2003-03-20 | Freeman Tracy K. | Method for suggesting corrective action in response to resource constraint |
US7751628B1 (en) * | 2001-12-26 | 2010-07-06 | Reisman Richard R | Method and apparatus for progressively deleting media objects from storage |
US6857045B2 (en) | 2002-01-25 | 2005-02-15 | International Business Machines Corporation | Method and system for updating data in a compressed read cache |
US6728738B2 (en) | 2002-04-03 | 2004-04-27 | Sun Microsystems, Inc. | Fast lifetime analysis of objects in a garbage-collected system |
US6654386B2 (en) * | 2002-04-24 | 2003-11-25 | Teledyne Technologies Incorporated | Method, system, and apparatus for processing aircraft data files |
US6895464B2 (en) | 2002-06-03 | 2005-05-17 | Honeywell International Inc. | Flash memory management system and method utilizing multiple block list windows |
US7334124B2 (en) | 2002-07-22 | 2008-02-19 | Vormetric, Inc. | Logical access block processing protocol for transparent secure file storage |
US7146521B1 (en) | 2002-08-21 | 2006-12-05 | 3Pardata, Inc. | Preventing damage of storage devices and data loss in a data storage system |
CN101114255A (en) | 2002-08-29 | 2008-01-30 | 松下电器产业株式会社 | Semiconductor memory device and method for writing data into flash memory |
US20040153844A1 (en) | 2002-10-28 | 2004-08-05 | Gautam Ghose | Failure analysis method and system for storage area networks |
US6831865B2 (en) | 2002-10-28 | 2004-12-14 | Sandisk Corporation | Maintaining erase counts in non-volatile storage systems |
US7072905B2 (en) | 2002-12-06 | 2006-07-04 | Sun Microsystems, Inc. | Better placement of objects reachable from outside a generation managed by the train algorithm |
US7181580B2 (en) | 2003-03-27 | 2007-02-20 | International Business Machines Corporation | Secure pointers |
WO2004095201A2 (en) | 2003-04-09 | 2004-11-04 | Intervideo Inc. | Systems and methods for caching multimedia data |
US7437530B1 (en) | 2003-04-24 | 2008-10-14 | Network Appliance, Inc. | System and method for mapping file block numbers to logical block addresses |
US7434097B2 (en) | 2003-06-05 | 2008-10-07 | Copan System, Inc. | Method and apparatus for efficient fault-tolerant disk drive replacement in raid storage systems |
US7089272B1 (en) | 2003-06-18 | 2006-08-08 | Sun Microsystems, Inc. | Specializing write-barriers for objects in a garbage collected heap |
WO2005042713A2 (en) | 2003-10-28 | 2005-05-12 | The Johns Hopkins University | Quantitative multiplex methylation-specific pcr |
US7434214B2 (en) | 2004-01-21 | 2008-10-07 | International Business Machines Corporation | Method for determining a close approximate benefit of reducing memory footprint of a Java application |
US20050188246A1 (en) | 2004-02-25 | 2005-08-25 | Emberty Robert G. | Persistent worldwide names assigned to removable media storage |
WO2005089397A2 (en) * | 2004-03-16 | 2005-09-29 | Advanced Tracking Technologies, Inc. | Geographic information data base engine |
US7526684B2 (en) | 2004-03-24 | 2009-04-28 | Seagate Technology Llc | Deterministic preventive recovery from a predicted failure in a distributed storage system |
US7493424B1 (en) | 2004-04-30 | 2009-02-17 | Netapp, Inc. | Network storage system with shared software stack for LDMA and RDMA |
JP4392601B2 (en) | 2004-05-07 | 2010-01-06 | パナソニック株式会社 | Data access device and recording medium |
US8042163B1 (en) | 2004-05-20 | 2011-10-18 | Symatec Operating Corporation | Secure storage access using third party capability tokens |
US7533292B2 (en) | 2004-07-15 | 2009-05-12 | International Business Machines Corporation | Management method for spare disk drives in a raid system |
EP1829332A2 (en) | 2004-12-15 | 2007-09-05 | Exostar Corporation | Enabling trust in a federated collaboration of networks |
US7426623B2 (en) | 2005-01-14 | 2008-09-16 | Sandisk Il Ltd | System and method for configuring flash memory partitions as super-units |
US8171169B2 (en) * | 2005-03-14 | 2012-05-01 | Citrix Systems, Inc. | Method and apparatus for updating a graphical display in a distributed processing environment |
US20060230245A1 (en) | 2005-04-08 | 2006-10-12 | Microsoft Corporation | Data storage safety indicator and expander |
US8200887B2 (en) | 2007-03-29 | 2012-06-12 | Violin Memory, Inc. | Memory management system and method |
US7689609B2 (en) | 2005-04-25 | 2010-03-30 | Netapp, Inc. | Architecture for supporting sparse volumes |
US7366825B2 (en) | 2005-04-26 | 2008-04-29 | Microsoft Corporation | NAND flash memory management |
US7894679B2 (en) * | 2005-06-29 | 2011-02-22 | Xerox Corporation | Data transferability predictor |
US20070005625A1 (en) * | 2005-07-01 | 2007-01-04 | Nec Laboratories America, Inc. | Storage architecture for embedded systems |
JP4506594B2 (en) | 2005-07-22 | 2010-07-21 | 日本電気株式会社 | Redundant path control method |
US7734768B2 (en) * | 2005-07-26 | 2010-06-08 | International Business Machines Corporation | System and method for adaptively collecting performance and event information |
US7694082B2 (en) | 2005-07-29 | 2010-04-06 | International Business Machines Corporation | Computer program and method for managing resources in a distributed storage system |
US7617216B2 (en) | 2005-09-07 | 2009-11-10 | Emc Corporation | Metadata offload for a file server cluster |
ITVA20050061A1 (en) | 2005-11-08 | 2007-05-09 | St Microelectronics Srl | METHOD OF MANAGEMENT OF A NON-VOLATILE MEMORY AND RELATIVE MEMORY DEVICE |
US7831783B2 (en) | 2005-12-22 | 2010-11-09 | Honeywell International Inc. | Effective wear-leveling and concurrent reclamation method for embedded linear flash file systems |
US7421552B2 (en) | 2006-03-17 | 2008-09-02 | Emc Corporation | Techniques for managing data within a data storage system utilizing a flash-based memory vault |
US7899780B1 (en) | 2006-03-30 | 2011-03-01 | Emc Corporation | Methods and apparatus for structured partitioning of management information |
US20070294564A1 (en) | 2006-04-27 | 2007-12-20 | Tim Reddin | High availability storage system |
US8266472B2 (en) | 2006-05-03 | 2012-09-11 | Cisco Technology, Inc. | Method and system to provide high availability of shared data |
US9455955B2 (en) | 2006-05-17 | 2016-09-27 | Richard Fetik | Customizable storage controller with integrated F+ storage firewall protection |
US7743239B2 (en) | 2006-06-30 | 2010-06-22 | Intel Corporation | Accelerating integrity checks of code and data stored in non-volatile memory |
US7974478B2 (en) * | 2006-08-24 | 2011-07-05 | Dell Products L.P. | Methods and apparatus for reducing storage size |
US7627786B2 (en) | 2006-09-26 | 2009-12-01 | International Business Machines Corporation | Tracking error events relating to data storage drives and/or media of automated data storage library subsystems |
US8620970B2 (en) | 2006-10-03 | 2013-12-31 | Network Appliance, Inc. | Methods and apparatus for changing versions of a filesystem |
US7669029B1 (en) | 2006-11-15 | 2010-02-23 | Network Appliance, Inc. | Load balancing a data storage system |
US7710777B1 (en) | 2006-12-20 | 2010-05-04 | Marvell International Ltd. | Semi-volatile NAND flash memory |
US7640332B2 (en) | 2006-12-27 | 2009-12-29 | Hewlett-Packard Development Company, L.P. | System and method for hot deployment/redeployment in grid computing environment |
KR100923990B1 (en) | 2007-02-13 | 2009-10-28 | 삼성전자주식회사 | Computing system based on characteristcs of flash storage |
US9632870B2 (en) | 2007-03-29 | 2017-04-25 | Violin Memory, Inc. | Memory system with multiple striping of raid groups and method for performing the same |
US7764965B2 (en) * | 2007-04-10 | 2010-07-27 | Microsoft Corporation | Dynamically changing service characteristics based on device and network connectivity attributes |
US7975115B2 (en) | 2007-04-11 | 2011-07-05 | Dot Hill Systems Corporation | Method and apparatus for separating snapshot preserved and write data |
US8706914B2 (en) | 2007-04-23 | 2014-04-22 | David D. Duchesneau | Computing infrastructure |
US7996599B2 (en) | 2007-04-25 | 2011-08-09 | Apple Inc. | Command resequencing in memory operations |
US7991942B2 (en) | 2007-05-09 | 2011-08-02 | Stmicroelectronics S.R.L. | Memory block compaction method, circuit, and system in storage devices based on flash memories |
US7870360B2 (en) | 2007-09-14 | 2011-01-11 | International Business Machines Corporation | Storage area network (SAN) forecasting in a heterogeneous environment |
KR101433859B1 (en) | 2007-10-12 | 2014-08-27 | 삼성전자주식회사 | Nonvolatile memory system and method managing file data thereof |
US8271700B1 (en) | 2007-11-23 | 2012-09-18 | Pmc-Sierra Us, Inc. | Logical address direct memory access with multiple concurrent physical ports and internal switching |
US7743191B1 (en) | 2007-12-20 | 2010-06-22 | Pmc-Sierra, Inc. | On-chip shared memory based device architecture |
JP4471007B2 (en) | 2008-02-05 | 2010-06-02 | ソニー株式会社 | RECORDING DEVICE, RECORDING DEVICE CONTROL METHOD, RECORDING DEVICE CONTROL METHOD PROGRAM AND RECORDING DEVICE CONTROL METHOD PROGRAM RECORDING MEDIUM |
US8949863B1 (en) | 2008-04-30 | 2015-02-03 | Netapp, Inc. | Creating environmental snapshots of storage device failure events |
US7925807B2 (en) * | 2008-05-27 | 2011-04-12 | Microsoft Corporation | Dynamic microcode for non-volatile memory |
US20100011012A1 (en) * | 2008-07-09 | 2010-01-14 | Rawson Andrew R | Selective Compression Based on Data Type and Client Capability |
US8093868B2 (en) | 2008-09-04 | 2012-01-10 | International Business Machines Corporation | In situ verification of capacitive power support |
US8369324B1 (en) * | 2008-09-29 | 2013-02-05 | Avaya Inc. | Variable compression queue |
US8086585B1 (en) | 2008-09-30 | 2011-12-27 | Emc Corporation | Access control to block storage devices for a shared disk based file system |
US7948913B1 (en) * | 2008-10-30 | 2011-05-24 | Clear Wireless Llc | Communicating data in various modes using header-compression algorithms |
US9473419B2 (en) | 2008-12-22 | 2016-10-18 | Ctera Networks, Ltd. | Multi-tenant cloud storage system |
US8762642B2 (en) | 2009-01-30 | 2014-06-24 | Twinstrata Inc | System and method for secure and reliable multi-cloud data replication |
JP4844639B2 (en) | 2009-02-19 | 2011-12-28 | Tdk株式会社 | MEMORY CONTROLLER, FLASH MEMORY SYSTEM HAVING MEMORY CONTROLLER, AND FLASH MEMORY CONTROL METHOD |
US9134922B2 (en) | 2009-03-12 | 2015-09-15 | Vmware, Inc. | System and method for allocating datastores for virtual machines |
KR101586047B1 (en) | 2009-03-25 | 2016-01-18 | 삼성전자주식회사 | Nonvolatile memory device and program methods for the same |
US8805953B2 (en) | 2009-04-03 | 2014-08-12 | Microsoft Corporation | Differential file and system restores from peers and the cloud |
TWI408689B (en) | 2009-04-14 | 2013-09-11 | Jmicron Technology Corp | Method for accessing storage apparatus and related control circuit |
US8094556B2 (en) * | 2009-04-27 | 2012-01-10 | Avaya Inc. | Dynamic buffering and synchronization of related media streams in packet networks |
US8504797B2 (en) | 2009-06-02 | 2013-08-06 | Hitachi, Ltd. | Method and apparatus for managing thin provisioning volume by using file storage system |
JP4874368B2 (en) | 2009-06-22 | 2012-02-15 | 株式会社日立製作所 | Storage system management method and computer using flash memory |
US7948798B1 (en) | 2009-07-22 | 2011-05-24 | Marvell International Ltd. | Mixed multi-level cell and single level cell storage device |
US8402242B2 (en) | 2009-07-29 | 2013-03-19 | International Business Machines Corporation | Write-erase endurance lifetime of memory storage devices |
US20110035540A1 (en) | 2009-08-10 | 2011-02-10 | Adtron, Inc. | Flash blade system architecture and method |
US8868957B2 (en) | 2009-09-24 | 2014-10-21 | Xyratex Technology Limited | Auxiliary power supply, a method of providing power to a data storage system and a back-up power supply charging circuit |
US9900150B2 (en) * | 2009-10-30 | 2018-02-20 | International Business Machines Corporation | Dispersed storage camera device and method of operation |
TWI428917B (en) | 2009-11-25 | 2014-03-01 | Silicon Motion Inc | Flash memory device, data storage system, and operation method of a data storage system |
US8250324B2 (en) | 2009-11-30 | 2012-08-21 | International Business Machines Corporation | Method to efficiently locate meta-data structures on a flash-based storage device |
US8140821B1 (en) * | 2009-12-18 | 2012-03-20 | Emc Corporation | Efficient read/write algorithms and associated mapping for block-level data reduction processes |
US8387136B2 (en) | 2010-01-05 | 2013-02-26 | Red Hat, Inc. | Role-based access control utilizing token profiles |
US8452932B2 (en) | 2010-01-06 | 2013-05-28 | Storsimple, Inc. | System and method for efficiently creating off-site data volume back-ups |
US9552299B2 (en) | 2010-06-11 | 2017-01-24 | California Institute Of Technology | Systems and methods for rapid processing and storage of data |
US8943028B2 (en) | 2010-06-29 | 2015-01-27 | Teradata Us, Inc. | Database compression analyzer |
US20120023144A1 (en) | 2010-07-21 | 2012-01-26 | Seagate Technology Llc | Managing Wear in Flash Memory |
US20120054264A1 (en) | 2010-08-31 | 2012-03-01 | International Business Machines Corporation | Techniques for Migrating Active I/O Connections with Migrating Servers and Clients |
US8566546B1 (en) | 2010-09-27 | 2013-10-22 | Emc Corporation | Techniques for enforcing capacity restrictions of an allocation policy |
US8775868B2 (en) | 2010-09-28 | 2014-07-08 | Pure Storage, Inc. | Adaptive RAID for an SSD environment |
US9060032B2 (en) * | 2010-11-01 | 2015-06-16 | Seven Networks, Inc. | Selective data compression by a distributed traffic management system to reduce mobile data traffic and signaling traffic |
US8949502B2 (en) | 2010-11-18 | 2015-02-03 | Nimble Storage, Inc. | PCIe NVRAM card based on NVDIMM |
US8812860B1 (en) | 2010-12-03 | 2014-08-19 | Symantec Corporation | Systems and methods for protecting data stored on removable storage devices by requiring external user authentication |
US9208071B2 (en) | 2010-12-13 | 2015-12-08 | SanDisk Technologies, Inc. | Apparatus, system, and method for accessing memory |
US8589723B2 (en) | 2010-12-22 | 2013-11-19 | Intel Corporation | Method and apparatus to provide a high availability solid state drive |
US8465332B2 (en) | 2011-01-13 | 2013-06-18 | Tyco Electronics Corporation | Contact assembly for an electrical connector |
WO2012103397A2 (en) * | 2011-01-28 | 2012-08-02 | Schlumberger Technology B.V. | Two dimensional nmr of diffusion and relaxation for material characterization |
US8578442B1 (en) | 2011-03-11 | 2013-11-05 | Symantec Corporation | Enforcing consistent enterprise and cloud security profiles |
US9185043B2 (en) * | 2011-04-08 | 2015-11-10 | Saratoga Data Systems, Inc. | Telecommunications protocol with PID control of data transmission rate |
US8738882B2 (en) | 2011-06-03 | 2014-05-27 | Apple Inc. | Pre-organization of data |
US8751463B1 (en) | 2011-06-30 | 2014-06-10 | Emc Corporation | Capacity forecasting for a deduplicating storage system |
US8769622B2 (en) | 2011-06-30 | 2014-07-01 | International Business Machines Corporation | Authentication and authorization methods for cloud computing security |
US9852017B2 (en) | 2011-07-27 | 2017-12-26 | International Business Machines Corporation | Generating dispersed storage network event records |
US8931041B1 (en) | 2011-07-29 | 2015-01-06 | Symantec Corporation | Method and system for visibility and control over access transactions between clouds using resource authorization messages |
US20130036272A1 (en) | 2011-08-02 | 2013-02-07 | Microsoft Corporation | Storage engine node for cloud-based storage |
US8527544B1 (en) | 2011-08-11 | 2013-09-03 | Pure Storage Inc. | Garbage collection in a storage system |
US9525900B2 (en) | 2011-09-15 | 2016-12-20 | Google Inc. | Video management system |
JP2013077278A (en) | 2011-09-16 | 2013-04-25 | Toshiba Corp | Memory device |
US9374356B2 (en) | 2011-09-29 | 2016-06-21 | Oracle International Corporation | Mobile oauth service |
IN2014CN03766A (en) | 2011-10-24 | 2015-07-03 | Schneider Electric Ind Sas | |
WO2013071087A1 (en) | 2011-11-09 | 2013-05-16 | Unisys Corporation | Single sign on for cloud |
CN104040516B (en) | 2011-11-17 | 2017-03-15 | 英特尔公司 | Method, apparatus and system for data deduplication |
US9330245B2 (en) | 2011-12-01 | 2016-05-03 | Dashlane SAS | Cloud-based data backup and sync with secure local storage of access keys |
US20130219164A1 (en) | 2011-12-29 | 2013-08-22 | Imation Corp. | Cloud-based hardware security modules |
US8613066B1 (en) | 2011-12-30 | 2013-12-17 | Amazon Technologies, Inc. | Techniques for user authentication |
US8800009B1 (en) | 2011-12-30 | 2014-08-05 | Google Inc. | Virtual machine service access |
US9235590B1 (en) * | 2011-12-30 | 2016-01-12 | Teradata Us, Inc. | Selective data compression in a database system |
US9423983B2 (en) | 2012-01-19 | 2016-08-23 | Syncsort Incorporated | Intelligent storage controller |
US9116812B2 (en) | 2012-01-27 | 2015-08-25 | Intelligent Intellectual Property Holdings 2 Llc | Systems and methods for a de-duplication cache |
JP2013161235A (en) | 2012-02-03 | 2013-08-19 | Fujitsu Ltd | Storage device, method for controlling storage device and control program for storage device |
US8996787B2 (en) | 2012-02-06 | 2015-03-31 | Sandisk Technologies Inc. | Storage device aware of I/O transaction and stored data |
US9048862B2 (en) * | 2012-04-11 | 2015-06-02 | Netapp, Inc. | Systems and methods for selecting data compression for storage data in a storage system |
US10474584B2 (en) | 2012-04-30 | 2019-11-12 | Hewlett Packard Enterprise Development Lp | Storing cache metadata separately from integrated circuit containing cache controller |
US8832372B2 (en) | 2012-05-24 | 2014-09-09 | Netapp, Inc. | Network storage systems having clustered raids for improved redundancy and load balancing |
WO2013188382A2 (en) | 2012-06-12 | 2013-12-19 | Centurylink Intellectual Property Llc | High performance cloud storage |
US9130927B2 (en) | 2012-07-02 | 2015-09-08 | Sk Planet Co., Ltd. | Single certificate service system and operational method thereof |
US9047181B2 (en) | 2012-09-07 | 2015-06-02 | Splunk Inc. | Visualization of data from clusters |
US8769651B2 (en) | 2012-09-19 | 2014-07-01 | Secureauth Corporation | Mobile multifactor single-sign-on authentication |
WO2014051552A1 (en) | 2012-09-25 | 2014-04-03 | Empire Technology Development Llc | Limiting data usage of a device connected to the internet via tethering |
US9245144B2 (en) | 2012-09-27 | 2016-01-26 | Intel Corporation | Secure data container for web applications |
US8990914B2 (en) | 2012-09-28 | 2015-03-24 | Intel Corporation | Device, method, and system for augmented reality security |
US8990905B1 (en) | 2012-09-28 | 2015-03-24 | Emc Corporation | Protected resource access control utilizing intermediate values of a hash chain |
US8850546B1 (en) | 2012-09-30 | 2014-09-30 | Emc Corporation | Privacy-preserving user attribute release and session management |
US20140101434A1 (en) | 2012-10-04 | 2014-04-10 | Msi Security, Ltd. | Cloud-based file distribution and management using real identity authentication |
US9209973B2 (en) | 2012-11-20 | 2015-12-08 | Google Inc. | Delegate authorization in cloud-based storage system |
US8997197B2 (en) | 2012-12-12 | 2015-03-31 | Citrix Systems, Inc. | Encryption-based data access management |
US9317223B2 (en) | 2012-12-17 | 2016-04-19 | International Business Machines Corporation | Method and apparatus for automated migration of data among storage centers |
US9934233B2 (en) * | 2012-12-20 | 2018-04-03 | Bae Systems Plc | Searchable data archive |
US9075529B2 (en) | 2013-01-04 | 2015-07-07 | International Business Machines Corporation | Cloud based data migration and replication |
US9646039B2 (en) | 2013-01-10 | 2017-05-09 | Pure Storage, Inc. | Snapshots in a storage system |
US9483657B2 (en) | 2013-01-14 | 2016-11-01 | Accenture Global Services Limited | Secure online distributed data storage services |
US9052917B2 (en) | 2013-01-14 | 2015-06-09 | Lenovo (Singapore) Pte. Ltd. | Data storage for remote environment |
US9009526B2 (en) | 2013-01-24 | 2015-04-14 | Hewlett-Packard Development Company, L.P. | Rebuilding drive data |
US20140229654A1 (en) | 2013-02-08 | 2014-08-14 | Seagate Technology Llc | Garbage Collection with Demotion of Valid Data to a Lower Memory Tier |
US20140230017A1 (en) | 2013-02-12 | 2014-08-14 | Appsense Limited | Programmable security token |
US8949488B2 (en) * | 2013-02-15 | 2015-02-03 | Compellent Technologies | Data replication with dynamic compression |
US8902532B2 (en) | 2013-03-20 | 2014-12-02 | International Business Machines Corporation | Write avoidance areas around bad blocks on a hard disk drive platter |
GB2513377A (en) | 2013-04-25 | 2014-10-29 | Ibm | Controlling data storage in an array of storage devices |
US9317382B2 (en) | 2013-05-21 | 2016-04-19 | International Business Machines Corporation | Storage device with error recovery indication |
US9147374B2 (en) * | 2013-05-21 | 2015-09-29 | International Business Machines Corporation | Controlling real-time compression detection |
US9727246B2 (en) | 2013-05-22 | 2017-08-08 | Hitachi, Ltd. | Memory device, computer system, and method of controlling memory device |
US10038726B2 (en) | 2013-06-12 | 2018-07-31 | Visa International Service Association | Data sensitivity based authentication and authorization |
US9124569B2 (en) | 2013-06-14 | 2015-09-01 | Microsoft Technology Licensing, Llc | User authentication in a cloud environment |
US8898346B1 (en) | 2013-06-20 | 2014-11-25 | Qlogic, Corporation | Method and system for configuring network devices |
US8984602B1 (en) | 2013-06-28 | 2015-03-17 | Emc Corporation | Protected resource access control utilizing credentials based on message authentication codes and hash chain values |
US9454423B2 (en) | 2013-09-11 | 2016-09-27 | Dell Products, Lp | SAN performance analysis tool |
CA2931098A1 (en) | 2013-09-27 | 2015-04-02 | Intel Corporation | Determination of a suitable target for an initiator by a control plane processor |
KR102114388B1 (en) | 2013-10-18 | 2020-06-05 | 삼성전자주식회사 | Method and apparatus for compressing memory of electronic device |
US9442662B2 (en) | 2013-10-18 | 2016-09-13 | Sandisk Technologies Llc | Device and method for managing die groups |
US9519580B2 (en) | 2013-11-11 | 2016-12-13 | Globalfoundries Inc. | Load balancing logical units in an active/passive storage system |
US9619311B2 (en) | 2013-11-26 | 2017-04-11 | International Business Machines Corporation | Error identification and handling in storage area networks |
US9280678B2 (en) | 2013-12-02 | 2016-03-08 | Fortinet, Inc. | Secure cloud storage distribution and aggregation |
US9529546B2 (en) | 2014-01-08 | 2016-12-27 | Netapp, Inc. | Global in-line extent-based deduplication |
US9395922B2 (en) | 2014-01-10 | 2016-07-19 | Hitachi, Ltd. | Information system and I/O processing method |
US10769016B2 (en) * | 2014-02-26 | 2020-09-08 | Pure Storage, Inc. | Storing a plurality of correlated data in a dispersed storage network |
US9594580B2 (en) * | 2014-04-09 | 2017-03-14 | Bitspray Corporation | Secure storage and accelerated transmission of information over communication networks |
US9250823B1 (en) | 2014-05-20 | 2016-02-02 | Emc Corporation | Online replacement of physical storage in a virtual storage system |
US9811748B2 (en) * | 2014-06-09 | 2017-11-07 | Verizon Patent And Licensing Inc. | Adaptive camera setting modification based on analytics data |
NO2988221T3 (en) | 2014-06-27 | 2018-01-06 | ||
US9516167B2 (en) | 2014-07-24 | 2016-12-06 | Genesys Telecommunications Laboratories, Inc. | Media channel management apparatus for network communications sessions |
US10204010B2 (en) | 2014-10-03 | 2019-02-12 | Commvault Systems, Inc. | Intelligent protection of off-line mail data |
US20160182542A1 (en) | 2014-12-18 | 2016-06-23 | Stuart Staniford | Denial of service and other resource exhaustion defense and mitigation using transition tracking |
US9521200B1 (en) | 2015-05-26 | 2016-12-13 | Pure Storage, Inc. | Locally providing cloud storage array services |
US9716755B2 (en) | 2015-05-26 | 2017-07-25 | Pure Storage, Inc. | Providing cloud storage array services by a local storage array in a data center |
US9444822B1 (en) | 2015-05-29 | 2016-09-13 | Pure Storage, Inc. | Storage array access control from cloud-based user authorization and authentication |
US9300660B1 (en) | 2015-05-29 | 2016-03-29 | Pure Storage, Inc. | Providing authorization and authentication in a cloud for a user of a storage array |
US20160350009A1 (en) | 2015-05-29 | 2016-12-01 | Pure Storage, Inc. | Buffering data to be written to an array of non-volatile storage devices |
US10021170B2 (en) | 2015-05-29 | 2018-07-10 | Pure Storage, Inc. | Managing a storage array using client-side services |
US10346043B2 (en) * | 2015-12-28 | 2019-07-09 | Pure Storage, Inc. | Adaptive computing for data compression |
US10572460B2 (en) | 2016-02-11 | 2020-02-25 | Pure Storage, Inc. | Compressing data in dependence upon characteristics of a storage system |
KR102527992B1 (en) | 2016-03-14 | 2023-05-03 | 삼성전자주식회사 | Data storage device and data processing system having the same |
US9507532B1 (en) | 2016-05-20 | 2016-11-29 | Pure Storage, Inc. | Migrating data in a storage array that includes a plurality of storage devices and a plurality of write buffer devices |
US10567406B2 (en) | 2016-08-16 | 2020-02-18 | International Business Machines Corporation | Cloud computing environment activity monitoring |
US10459657B2 (en) | 2016-09-16 | 2019-10-29 | Hewlett Packard Enterprise Development Lp | Storage system with read cache-on-write buffer |
US11076509B2 (en) | 2017-01-24 | 2021-07-27 | The Research Foundation for the State University | Control systems and prediction methods for it cooling performance in containment |
US10983911B2 (en) * | 2017-09-01 | 2021-04-20 | Seagate Technology Llc | Capacity swapping based on compression |
US10846137B2 (en) | 2018-01-12 | 2020-11-24 | Robin Systems, Inc. | Dynamic adjustment of application resources in a distributed computing system |
US11106810B2 (en) | 2018-07-30 | 2021-08-31 | EMC IP Holding Company LLC | Multi-tenant deduplication with non-trusted storage system |
US10877683B2 (en) | 2019-04-09 | 2020-12-29 | International Business Machines Corporation | Tiered storage optimization and migration |
-
2016
- 2016-02-11 US US15/041,307 patent/US10572460B2/en active Active
- 2016-10-31 EP EP16795208.4A patent/EP3414652A1/en not_active Withdrawn
- 2016-10-31 WO PCT/US2016/059787 patent/WO2017138990A1/en active Application Filing
-
2020
- 2020-01-15 US US16/743,024 patent/US11392565B1/en active Active
-
2022
- 2022-06-17 US US17/807,447 patent/US11748322B2/en active Active
-
2023
- 2023-08-29 US US18/457,978 patent/US20230409546A1/en active Pending
Also Published As
Publication number | Publication date |
---|---|
US20170235774A1 (en) | 2017-08-17 |
US10572460B2 (en) | 2020-02-25 |
US20220318216A1 (en) | 2022-10-06 |
EP3414652A1 (en) | 2018-12-19 |
WO2017138990A1 (en) | 2017-08-17 |
US11748322B2 (en) | 2023-09-05 |
US11392565B1 (en) | 2022-07-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11748322B2 (en) | Utilizing different data compression algorithms based on characteristics of a storage system | |
US11281375B1 (en) | Optimizing for data reduction in a storage system | |
US10970202B1 (en) | Managing input/output (‘I/O’) requests in a storage system that includes multiple types of storage devices | |
US10884666B1 (en) | Dynamic path selection in a storage network | |
US11914861B2 (en) | Projecting capacity in a storage system based on data reduction levels | |
US20220317894A1 (en) | Supporting A Stateless Controller In A Storage System | |
US11016700B1 (en) | Analyzing application-specific consumption of storage system resources |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: PURE STORAGE, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:COLGROVE, JOHN;ENGEL, JOERN;GOLDEN, CHRISTOPHER;AND OTHERS;SIGNING DATES FROM 20160210 TO 20160211;REEL/FRAME:064749/0230 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |