Patents by Inventor Ori Shalev
Ori Shalev has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20140304428Abstract: Delay commands are injected into sequential input/output (I/O) requests and the effects of the injected delay commands are measured for determining whether a storage system handling the sequential input/output (IO) requests is causing a bottleneck.Type: ApplicationFiled: April 9, 2013Publication date: October 9, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan FISCHER-TOUBOL, Omer HAKLAY, Nir MILSTEIN, Ori SHALEV
-
Patent number: 8805855Abstract: For efficiently storing and retrieving data and metadata in phases, in a first phase, metadata tokens, which are assigned to most active metadata-emitting entities, are used for storing the data and the metadata together in a single input/output operation while piggybacking the metadata of least active metadata-emitting entities onto one of the most active metadata-emitting entities having one of the metadata tokens. In a second phase, the metadata is re-written to a metadata delta journal for reclaiming the metadata tokens. In a third phase, the metadata journal is applied to a metadata structure containing the metadata of the storage system, the metadata delta journal is then cleared after successfully updating the main metadata structure with the metadata of the metadata journal. The metadata journal is swapped with an empty metadata journal for concurrently adding metadata while retaining the metadata journal until applying the metadata delta journal to the metadata structure.Type: GrantFiled: August 17, 2012Date of Patent: August 12, 2014Assignee: International Business Machines CorporationInventors: Ben Sasson, Ori Shalev
-
Patent number: 8799543Abstract: Various embodiments for transforming a logical data object for storage in a storage device operable with at least one storage protocol are provided. In one such embodiment, the logical data object into one or more segments are divided with each segment characterized by respective start and end offsets. One or more obtained variable size data chunks are processed corresponding to the logical data object to obtain processed data chunks, wherein at least one of the processed data chunks comprises transformed data resulting from the processing. Each of the variable size data chunks is associated with a respective segment of the logical data object. The processed data chunks are sequentially accommodated in accordance with an order of chunks received while keeping the association with the respective segments.Type: GrantFiled: August 5, 2011Date of Patent: August 5, 2014Assignee: International Business Machines CorporationInventors: Jonathan Amit, Ori Shalev
-
Patent number: 8793416Abstract: Various embodiments for transforming a logical data object for storage in a storage device operable with at least one storage protocol are provided. In one such embodiment, the logical data object into one or more segments are divided with each segment characterized by respective start and end offsets. One or more obtained variable size data chunks are processed corresponding to the logical data object to obtain processed data chunks, wherein at least one of the processed data chunks comprises transformed data resulting from the processing. Each of the variable size data chunks is associated with a respective segment of the logical data object. The processed data chunks are sequentially accommodated in accordance with an order of chunks received while keeping the association with the respective segments.Type: GrantFiled: August 5, 2011Date of Patent: July 29, 2014Assignee: International Business Machines CorporationInventors: Jonathan Amit, Ori Shalev
-
Patent number: 8788712Abstract: Exemplary system and computer program product embodiments compression blocks input/output (I/O) reduction are provided. In one embodiment, by way of example only, data blocks are arranged into groups to provide a single I/O. Lists indicating the available block space for the data blocks are organized in advance according to space size. The data blocks required for a single command are allocated as the single I/O. The data blocks are sequentially ordered. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: GrantFiled: January 6, 2012Date of Patent: July 22, 2014Assignee: International Business Machines CorporationInventors: Jonathan Amit, Chaim Koifman, Sergey Marenkov, Ori Shalev
-
Patent number: 8788713Abstract: Exemplary method, system, and computer program product embodiments compression blocks input/output (I/O) reduction are provided. In one embodiment, by way of example only, data blocks are arranged into groups to provide a single I/O. Lists indicating the available block space for the data blocks are organized in advance according to space size. The data blocks required for a single command are allocated as the single I/O. The data blocks are sequentially ordered. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: GrantFiled: March 7, 2013Date of Patent: July 22, 2014Assignee: International Business Machines CorporationInventors: Jonathan Amit, Chaim Koifman, Sergey Marenkov, Ori Shalev
-
Patent number: 8782019Abstract: For on-line separation of data chunks for compression, unrelated data chunks are classified based on various attributes. The classified data chunks are sent to at least one available compression contexts. The classified data chunks are related. The classified data chunks are encoded by at least one the compression operations. A compression ratio is achieved and included as feedback.Type: GrantFiled: June 27, 2012Date of Patent: July 15, 2014Assignee: International Business Machines CorporationInventors: Jonathan Amit, Ori Shalev
-
Publication number: 20140188823Abstract: A data chunk is compressed into a storage block when emitting the data chunk. If the data chunk is unable to be completely compressed into the storage block, attributes of the data chunk are analyzed for determining whether the data chunk should be split. If the data chunk should be split, a remaining portion of the data chunk is compressed to a next chronological 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.Type: ApplicationFiled: January 2, 2013Publication date: July 3, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Sergey MARENKOV, Ben SASSON, Ori SHALEV
-
Publication number: 20140188824Abstract: A data chunk is compressed into a storage block when emitting the data chunk. If the data chunk is unable to be completely compressed into the storage block, attributes of the data chunk are analyzed for determining whether the data chunk should be split. If the data chunk should be split, a remaining portion of the data chunk is compressed to a next chronological 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.Type: ApplicationFiled: November 7, 2013Publication date: July 3, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Sergey MARENKOV, Ben SASSON, Ori SHALEV
-
Patent number: 8682091Abstract: Exemplary method, system, and computer program product embodiments for real-time image recompression are provided. In one embodiment, by way of example only, compressed segments that are identified as having used at least one of a plurality of inefficient compression operations are partially decoded. The compressed segments are recompressed by employing context mapping. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: GrantFiled: August 18, 2011Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Jonathan Amit, Lilia Demidov, Nir Halowani, Ori Shalev
-
Publication number: 20140059004Abstract: For efficiently storing and retrieving data and metadata in phases, in a first phase, metadata tokens, which are assigned to most active metadata-emitting entities, are used for storing the data and the metadata together in a single input/output operation while piggybacking the metadata of least active metadata-emitting entities onto one of the most active metadata-emitting entities having one of the metadata tokens. In a second phase, the metadata is re-written to a metadata delta journal for reclaiming the metadata tokens. In a third phase, the metadata journal is applied to a metadata structure containing the metadata of the storage system, the metadata delta journal is then cleared after successfully updating the main metadata structure with the metadata of the metadata journal. The metadata journal is swapped with an empty metadata journal for concurrently adding metadata while retaining the metadata journal until applying the metadata delta journal to the metadata structure.Type: ApplicationFiled: November 5, 2013Publication date: February 27, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ben SASSON, Ori SHALEV
-
Publication number: 20140052691Abstract: For efficiently storing and retrieving data and metadata in phases, in a first phase, metadata tokens, which are assigned to most active metadata-emitting entities, are used for storing the data and the metadata together in a single input/output operation while piggybacking the metadata of least active metadata-emitting entities onto one of the most active metadata-emitting entities having one of the metadata tokens. In a second phase, the metadata is re-written to a metadata delta journal for reclaiming the metadata tokens. In a third phase, the metadata journal is applied to a metadata structure containing the metadata of the storage system, the metadata delta journal is then cleared after successfully updating the main metadata structure with the metadata of the metadata journal. The metadata journal is swapped with an empty metadata journal for concurrently adding metadata while retaining the metadata journal until applying the metadata delta journal to the metadata structure.Type: ApplicationFiled: August 17, 2012Publication date: February 20, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ben SASSON, Ori SHALEV
-
Patent number: 8599048Abstract: A compression system configured to compress logical data objects into one or more accommodation blocks with a predefined size, and a method of operating thereof are provided. The compression system includes a compression engine capable of compressing input data with the help of sequential encoding one or more input strings and a counter operatively coupled to the compression engine. The counter is configured to keep its ongoing value indicative of a number of input bytes in one or more strings successfully encoded into a given accommodation block; and, responsive to unsuccessful compression of a string into the given accommodation block, to provide the compression engine with information indicative of starting point in the input stream for encoding into the next accommodation block, thus giving rise to a “start indication.Type: GrantFiled: May 26, 2011Date of Patent: December 3, 2013Assignee: International Business Machines CorporationInventors: Ori Shalev, Jonathan Amit
-
Patent number: 8581752Abstract: A compression system configured to compress logical data objects into one or more accommodation blocks with a predefined size, and a method of operating thereof are provided. The compression system includes a compression engine capable of compressing input data with the help of sequential encoding one or more input strings and a counter operatively coupled to the compression engine. The counter is configured to keep its ongoing value indicative of a number of input bytes in one or more strings successfully encoded into a given accommodation block; and, responsive to unsuccessful compression of a string into the given accommodation block, to provide the compression engine with information indicative of starting point in the input stream for encoding into the next accommodation block, thus giving rise to a “start indication.Type: GrantFiled: May 26, 2011Date of Patent: November 12, 2013Assignee: International Business Machines CorporationInventors: Ori Shalev, Jonathan Amit
-
Patent number: 8578058Abstract: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.Type: GrantFiled: March 9, 2011Date of Patent: November 5, 2013Assignee: International Business Machines CorporationInventors: Lilia Demidov, Nir Halowani, Ori Shalev
-
Patent number: 8566477Abstract: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.Type: GrantFiled: October 27, 2011Date of Patent: October 22, 2013Assignee: International Business Machines CorporationInventors: Lilia Demidov, Nir Halowani, Ori Shalev
-
Patent number: 8560508Abstract: 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.Type: GrantFiled: July 22, 2011Date of Patent: October 15, 2013Assignee: International Business Machines CorporationInventors: Jonathan Amit, Chaim Koifman, Rostislav Raikhman, Ori Shalev
-
Publication number: 20130179597Abstract: Exemplary system and computer program product embodiments compression blocks input/output (I/O) reduction are provided. In one embodiment, by way of example only, data blocks are arranged into groups to provide a single I/O. Lists indicating the available block space for the data blocks are organized in advance according to space size. The data blocks required for a single command are allocated as the single I/O. The data blocks are sequentially ordered. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: ApplicationFiled: January 6, 2012Publication date: July 11, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Chaim KOIFMAN, Sergey MARENKOV, Ori SHALEV
-
Publication number: 20130179411Abstract: For on-line separation of data chunks for compression, unrelated data chunks are classified based on various attributes. The classified data chunks are sent to at least one available compression contexts. The classified data chunks are related. The classified data chunks are encoded by at least one the compression operations. A compression ratio is achieved and included as feedback.Type: ApplicationFiled: June 27, 2012Publication date: July 11, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Ori SHALEV
-
Publication number: 20130179409Abstract: For on-line separation of data chunks for compression, unrelated data chunks are classified based on various attributes. The classified data chunks are sent to at least one available compression contexts. The classified data chunks are related. The classified data chunks are encoded by at least one the compression operations. A compression ratio is achieved and included as feedback.Type: ApplicationFiled: January 6, 2012Publication date: July 11, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Ori SHALEV