Abstract: In a read processing storage system, using a pool of CPU cores, the CPU cores are assigned to process either write operations, read operations, and read and write operations, that are scheduled for processing. A minimal number of the CPU cores are allocated for processing the write operations, thereby increasing write latency.

Abstract: Methods, systems, and computer program product embodiments for controlling congestion in a storage grid, by a processor device, are provided. In a storage grid, a storage request transmit queue length of storage requests submitted by a plurality of nodes is monitored, the storage request transmit queue comprising a queue holding the storage requests unable to be transmitted through a current transmission control protocol/internet protocol (TCP/IP) socket buffer of the storage grid. Upon reaching at least one of a certain threshold, a watermarked message indicating a specific one of the plurality of nodes is congested is transmitted to upper layer grid nodes in a hierarchy of the plurality of nodes transmitting the storage requests, and the upper layer grid nodes each alter the storage requests based upon the watermarked message.

Abstract: Methods, systems, and computer program product embodiments for controlling congestion in a storage grid, by a processor device, are provided. In a storage grid, a storage request transmit queue length is monitored. Upon reaching at least one of a certain threshold, a watermarked message is transmitted to a receiving node, the receiving node altering storage requests based upon the watermarked message.

Abstract: In a compression processing storage system, using a pool of encryption processing cores, the encryption processing cores are assigned to process either encryption operations, decryption operations, and decryption and encryption operations, that are scheduled for processing. A maximum number of the encryption processing cores are set for processing only the decryption operations, thereby lowering a decryption latency. A minimal number of the encryption processing cores are allocated for processing the encryption operations, thereby increasing encryption latency. Upon reaching a throughput limit for the encryption operations that causes the minimal number of the plurality of encryption processing cores to reach a busy status, the minimal number of the plurality of encryption processing cores for processing the encryption operations is increased.

Abstract: Compression blocks are divided into partitions creating a two dimensional divide of the compression blocks by slicing the compression blocks forming a first dimension and sub-partitioning the compression blocks into the partitions forming a second dimension. Each one of the partitions are compressed in separate compression streams.

Abstract: For real-time classification of data into data compression domains, a decision is made for which of the data compression domains write operations should be forwarded by reading randomly selected data of the write operations for computing a set of classifying heuristics thereby creating a fingerprint for each of the write operations. The write operations having a similar fingerprint are compressed together in a similar compression stream.

Abstract: In one embodiment, a computer program product is configured for performing deduplication in conjunction with random read and write operations across a namespace divided into a plurality of disjoint regions. The computer program product includes a computer readable storage medium having program instructions embodied therewith, where the computer readable storage medium is not a transitory signal per se. The program instructions are executable by a computer to cause the computer to perform a method including: maintaining a metadata structure for each of the plurality of disjoint regions via the respective region manager(s) of the plurality of disjoint regions, each metadata structure comprising metadata indicating a physical storage location of one or more data chunks associated with the respective region; and performing, by the computer, a deduplicated write operation of a first data chunk in a first region of the plurality of disjoint regions.

Abstract: For serving sequential read patterns from a compressed journal storage system, a construction area cache algorithm is used to temporarily store the read and decompressed data in a user view sequential order to minimize disk I/Os and CPU utilization while serving the data to the user.

Abstract: A computer-implemented method includes receiving a set of representative machine image regions for a computing environment wherein the set of representative machine image regions collectively comprise a set of representative image chunks. The method also includes generating a fingerprint for each representative image chunk within the set of representative image chunks to produce a set of representative fingerprints, generating a fingerprint for selected image chunks within a measured machine image region to produce a set of sampled fingerprints, and determining a deduplication metric for the measured machine image region based on the representative fingerprints and the sampled fingerprints. A corresponding computer program product and computer system are also disclosed herein.

Abstract: While discharging a data chunk the chunk is compressed into a storage block. If the chunk is found to be too large to be able to be completely compressed into the storage block certain characteristics of the data chunk are examined to determine whether or not the data chunk should be split. If the data chunk should be split, a remaining portion of the data chunk is compressed to a storage block that is next in chronological order to the original storage block. If the data chunk should not be split, all of the data chunk is moved to the next chronological storage block while leaving any remaining space in the storage block as unused.

Abstract: While discharging a data chunk, the chunk is compressed into a storage block. If the chunk is found to be too large to be able to be completely compressed into the storage block, certain characteristics of the data chunk are examined to determine whether or not the data chunk should be split. If the data chunk should be split, a remaining portion of the data chunk is compressed to a storage block that is next in chronological order to the original storage block. If the data chunk should not be split, all of the data chunk is moved to the next chronological storage block while leaving any remaining space in the storage block as unused.

Abstract: Various embodiments for data compression by a processor. Levels of data distribution are configured for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes. Input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed.

Abstract: Identification of data candidates for data processing is performed in real time by a processor device in a computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate, the heuristic computed by, for each one of the data classes, calculating an expected number of characters to be in a data class, calculating an expected number of characters that will not belong to a predefined set of the data classes, and calculating an actual number of the characters for each of the data classes and the non-classifiable data.

Abstract: Various embodiments for data management in a storage grid, by a processor device, are provided. In one embodiment, a method comprises directing data Input/Output (I/O) operations from a host to an owning node according to a Logical Block Address (LBA) without a static assignment of ownership, notwithstanding any relationship between the host and the storage grid.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include detecting, on a communications network in a computing facility including a first computer coupled to a second computer via the communications network, an input/output (I/O) request conveyed from the first computer to the second computer. Subsequent to detecting the I/O request, data traffic resulting from the second computer processing the I/O request is identified on the communications network, and network statistics are collected based on the I/O request and the data traffic. Upon detecting a performance degradation of the computing facility, the performance degradation greater than a predetermined amount, heuristics can be applied to the collected network statistics, to identify a cause of the performance degradation and to identify a remedy to the detected performance degradation. In some embodiments, the identified cause and the identified remedy can be presented to a user on a display.

Abstract: Identification of data candidates for data processing is performed in real time by a processor device in a distributed computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate, the heuristic computed by, for each one of the data classes, calculating an expected number of characters to be in a data class, calculating an expected number of characters that will not belong to a predefined set of the data classes, and calculating an actual number of the characters for each of the data classes and the non-classifiable data.

Abstract: Methods, systems, and computer storage mediums including a computer program product for managing data in a computing network are provided. One method includes registering a plurality of buffers with a work queue in a server and assigning ownership to each of the plurality of buffers to a different working thread in a plurality of working threads. The method further includes continuously polling, by a polling thread, the work queue to determine when work requests are received by the work queue, upon receipt of each work request, determining which buffer among the plurality of buffers each work request is associated, and performing each work request on each respective associated buffer by a working thread among the plurality of working threads that owns each respective associated buffer. One system includes a processor for performing the above method and one computer storage medium includes computer code for performing the above method.

Abstract: Various embodiments for data management in a storage grid, by a processor device, are provided. In one embodiment, a method comprises directing data Input/Output (I/O) operations from a host to an owning node according to a Logical Block Address (LBA) without a static assignment of ownership, notwithstanding any relationship between the host and the storage grid.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include configuring a storage system to store multiple storage entities for access by one or more host computers in communication with the storage system, and specifying a compression condition including a minimum compression ratio. The storage system can then estimate an expected compression ratio for a given storage entity, compress the given storage entity upon the expected compression ratio meeting the compression condition, and provide, to a given host computer, access to the compressed given storage entity.

Abstract: Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information. A scanning operation is performed by searching a suffix of each of the sorted data streams for identifying a data sequence that includes a first symbol representing textual data, and a second symbol representing numerical data. The suffix tree for the converted data is then built.