Patent application number | Description | Published |
20110208789 | TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID. | 08-25-2011 |
20110302218 | TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID. | 12-08-2011 |
20110302219 | TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID. | 12-08-2011 |
20130024433 | REAL-TIME COMPRESSION OF TABULAR DATA - Exemplary method, system, and computer program product embodiments for real-time column compression of data are provided. In one embodiment, by way of example only, a data structure is estimated for an initially unknown structured data. The estimated data structure is placed in a stream. A columnar compression operation is applied to the stream to generate an achieved compression ratio. The stream is compressed. Feedback of the achieved compression ratio is analyzed from the stream to determine if an optimal one of the columnar compression operations has been applied. If the optimal one of the columnar compression operations has been applied, the actual data structure of the initially unknown structured data is determined. | 01-24-2013 |
20130097210 | EFFICIENT GARBAGE COLLECTION IN A COMPRESSED JOURNAL FILE - Exemplary method, system, and computer program product embodiments for efficient garbage collection in a compressed journal file system are provided. In one embodiment, by way of example only, a map corresponding to data blocks with overwritten compressed journal entries is configured. Weighted conditions for each of the overwritten compressed journal entries are calculated. The weighted conditions are arranged in the map from lowest to highest. One of the weighted conditions includes a biasing variable towards selecting data blocks having free space at an end of at least one associated record. Additional system and computer program product embodiments are disclosed and provide related advantages. | 04-18-2013 |
20130185338 | EFFICIENT GARBAGE COLLECTION IN A COMPRESSED JOURNAL FILE - A map corresponding to data blocks with overwritten compressed journal entries is configured. Weighted conditions for each of the overwritten compressed journal entries are calculated. The weighted conditions are arranged in the map from lowest to highest. One of the weighted conditions includes a biasing variable towards selecting data blocks having free space at an end of at least one associated record. | 07-18-2013 |
20130339322 | REDUCING DECOMPRESSION LATENCY IN A COMPRESSION STORAGE SYSTEM - In a compression processing storage system, using a pool of compression cores, the compression cores are assigned to process either compression operations, decompression operations, or decompression and compression operations, which are scheduled for processing. A maximum number of the compression cores are set for processing only the decompression operations, thereby lowering a decompression latency. A minimal number of the compression cores are allocated for processing the compression operations, thereby increasing compression latency. Upon reaching a throughput limit for the compression operations that causes the minimal number of the plurality of compression cores to reach a busy status, the minimal number of the plurality of compression cores for processing the compression operations is increased. | 12-19-2013 |
20130339635 | REDUCING READ LATENCY USING A POOL OF PROCESSING CORES - 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 maximum number of the CPU cores are set for processing only the read operations, thereby lowering a read latency. A minimal number of the CPU cores are allocated for processing the write operations, thereby increasing write latency. Upon reaching a throughput limit for the write operations that causes the minimal number of the plurality of CPU cores to reach a busy status, the minimal number of the plurality of CPU cores for processing the write operations is increased. | 12-19-2013 |
20130339750 | REDUCING DECRYPTION LATENCY FOR ENCRYPTION PROCESSING - In a 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. | 12-19-2013 |
20140250305 | REDUCING DECRYPTION LATENCY FOR ENCRYPTION PROCESSING - 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. | 09-04-2014 |