Patents by Inventor Andrey Zaitsev
Andrey Zaitsev 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).
-
Patent number: 11442644Abstract: Aspects of the present disclosure describe methods and systems for optimized re-striping in an erasure encoded storage. In one exemplary aspect, a method may receive a request to re-stripe a plurality of data blocks arranged as a tile in the erasure encoded storage, wherein the request comprises a desired tile width. The method may identify (1) a number of data blocks in the tile and (2) a width of the tile. The method may determine a maximum number of data blocks that do not need to be rearranged when reconfiguring the tile to the desired tile width. Furthermore, the method may determine a tile reconfiguration with the desired tile width that does not rearrange the maximum number of the data blocks of the tile, and may re-stripe the tile in accordance with the tile reconfiguration.Type: GrantFiled: August 6, 2020Date of Patent: September 13, 2022Assignee: Acronis International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Alexey Kuznetsov, Yuri Per, Stanislav Protasov, Serguei Beloussov
-
Patent number: 11334247Abstract: Disclosed herein are systems and method for de-duplicating blocks of data. In one aspect, an exemplary method comprises receiving a block of data at a de-duplication engine that comprises a first block node and a first page node, wherein the first block node stores a single block descriptor for at least two identical blocks previously received and wherein the first page node stores single instances of identical pages in the at least two identical blocks. The method comprises comparing the received block with the at least two identical blocks. In response to determining that the received block partially matches the at least two identical blocks, the method comprises storing a block descriptor of the received block in a second block node and storing at least one page that matches between the received block and the at least two identical blocks in a second page node of the de-duplication engine.Type: GrantFiled: September 30, 2020Date of Patent: May 17, 2022Assignee: Acronis International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Patent number: 11226737Abstract: Disclosed herein are systems and method for de-duplicating blocks of data. In one aspect, an exemplary method comprises for each previously de-duplicated block of data of a de-duplication engine, storing de-duplicated pages references by hashes and a block descriptor. The method comprises receiving, at the de-duplication engine, a new block of data for de-duplication assessment and determining a similarity of the received block to the previously de-duplicated blocks. When the received block is determined as being similar to the previously de-duplicated blocks, the method comprises storing the received block without duplication in the de-duplication engine, including pages of the block referenced by the hashes and the block descriptor.Type: GrantFiled: September 30, 2020Date of Patent: January 18, 2022Assignee: Acronis International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Patent number: 11221779Abstract: Disclosed herein are systems and method for building content for a de-duplication engine. In one aspect, an exemplary method comprises periodically receiving instructions for cycling through a coalescing phase and a sedimentation phase of the de-duplication engine, during a first coalescing phase, selecting a set of seed blocks that are similar to each other, when an instruction for proceeding to a next sedimentation phase is received, entering the sedimentation phase during which newly received blocks are processed to be stored near similar seed blocks, and when an instruction to proceed to a next coalescing phase is received, entering the coalescing phase to update the set of seed blocks.Type: GrantFiled: June 10, 2019Date of Patent: January 11, 2022Assignee: Acronis International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Patent number: 11132137Abstract: Disclosed herein are systems and method for read-optimized de-duplication of blocks of data. In one aspect, an exemplary method comprises for each page of a newly received block of data, computing a page hash and assigning a page context ID, computing an index of a page node for storing the page and selecting the page node, when the selected page node contains a copy of the page, adding a page reference to a block descriptor with the page being referenced by the page hash augmented by the page context ID, otherwise, storing the page in plain storage; and for the block of data, storing the block descriptor in a block node of the de-duplication engine, the block of data being referenced by a block hash and the block descriptor containing at least a list of pages of the block stored in page nodes of the de-duplication engine.Type: GrantFiled: January 31, 2020Date of Patent: September 28, 2021Assignee: Acronis International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Stanislav Protasov, Serguei Beloussov
-
Publication number: 20210286538Abstract: Aspects of the present disclosure describe methods and systems for optimized re-striping in an erasure encoded storage. In one exemplary aspect, a method may receive a request to re-stripe a plurality of data blocks arranged as a tile in the erasure encoded storage, wherein the request comprises a desired tile width. The method may identify (1) a number of data blocks in the tile and (2) a width of the tile. The method may determine a maximum number of data blocks that do not need to be rearranged when reconfiguring the tile to the desired tile width. Furthermore, the method may determine a tile reconfiguration with the desired tile width that does not rearrange the maximum number of the data blocks of the tile, and may re-stripe the tile in accordance with the tile reconfiguration.Type: ApplicationFiled: August 6, 2020Publication date: September 16, 2021Inventors: Oleg Volkov, Andrey Zaitsev, Alexey Kuznetsov, Yuri Per, Stanislav Protasov, Serguei Beloussov
-
Publication number: 20210240376Abstract: Disclosed herein are systems and method for read-optimized de-duplication of blocks of data. In one aspect, an exemplary method comprises for each page of a newly received block of data, computing a page hash and assigning a page context ID, computing an index of a page node for storing the page and selecting the page node, when the selected page node contains a copy of the page, adding a page reference to a block descriptor with the page being referenced by the page hash augmented by the page context ID, otherwise, storing the page in plain storage; and for the block of data, storing the block descriptor in a block node of the de-duplication engine, the block of data being referenced by a block hash and the block descriptor containing at least a list of pages of the block stored in page nodes of the de-duplication engine.Type: ApplicationFiled: January 31, 2020Publication date: August 5, 2021Inventors: Oleg Volkov, Andrey Zaitsev, Stanislav Protasov, Serguei Beloussov
-
Patent number: 11023318Abstract: A system and method is provided for fast random access erasure encoded storage. An exemplary method includes writing data to an append-only data log that includes data log extents that are each associated with data that is mapped to corresponding offset range of a virtual file of a client and storing the append-only data log as a sequence of data chunks each allocated on one or more one storage disks. Moreover, the method determines an amount of useful data in one or more data chunks and, when the amount of useful data in the data chunk is less than a predetermined threshold, appending the useful data from the data chunk to an end of the append-only data log. Finally, the data log is cleaned by releasing the one or more data chunk from the append-only data log after the useful data is appended to the append-only data log.Type: GrantFiled: June 21, 2018Date of Patent: June 1, 2021Assignee: Virtuozzo International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Alexey Kuznetzov, Pavel Emelyanov, Alexey Kobets, Kirill Korotaev
-
Publication number: 20210026536Abstract: Disclosed herein are systems and method for de-duplicating blocks of data. In one aspect, an exemplary method comprises receiving a block of data at a de-duplication engine that comprises a first block node and a first page node, wherein the first block node stores a single block descriptor for at least two identical blocks previously received and wherein the first page node stores single instances of identical pages in the at least two identical blocks. The method comprises comparing the received block with the at least two identical blocks. In response to determining that the received block partially matches the at least two identical blocks, the method comprises storing a block descriptor of the received block in a second block node and storing at least one page that matches between the received block and the at least two identical blocks in a second page node of the de-duplication engine.Type: ApplicationFiled: September 30, 2020Publication date: January 28, 2021Inventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Publication number: 20210011628Abstract: Disclosed herein are systems and method for de-duplicating blocks of data. In one aspect, an exemplary method comprises for each previously de-duplicated block of data of a de-duplication engine, storing de-duplicated pages references by hashes and a block descriptor. The method comprises receiving, at the de-duplication engine, a new block of data for de-duplication assessment and determining a similarity of the received block to the previously de-duplicated blocks. When the received block is determined as being similar to the previously de-duplicated blocks, the method comprises storing the received block without duplication in the de-duplication engine, including pages of the block referenced by the hashes and the block descriptor.Type: ApplicationFiled: September 30, 2020Publication date: January 14, 2021Inventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguel Beloussov, Stanisiav Protasov
-
Patent number: 10877666Abstract: Disclosed herein are systems and method for de-duplicating blocks of data. In one aspect, an exemplary method comprises for each previously de-duplicated block of data of a de-duplication engine, storing de-duplicated pages references by hashes and a block descriptor, creating a set of hash components of the previously de-duplicated blocks, and for each newly received block of data for de-duplication, calculating a translation tolerant hash vector including a predetermined number of hash components, determining a similarity of the received block to the previously de-duplicated blocks based on a comparison of the hash components of the received block with the hash components in the set, and when the received block is determined as being similar to the previously processed blocks based on the comparison, storing the block without duplication in the de-duplication engine, including pages of the block referenced by hashes and a block descriptor.Type: GrantFiled: June 10, 2019Date of Patent: December 29, 2020Assignee: Acronis International GmbHInventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Publication number: 20200387308Abstract: Disclosed herein are systems and method for de-duplicating blocks of data. In one aspect, an exemplary method comprises for each previously de-duplicated block of data of a de-duplication engine, storing de-duplicated pages references by hashes and a block descriptor, creating a set of hash components of the previously de-duplicated blocks, and for each newly received block of data for de-duplication, calculating a translation tolerant hash vector including a predetermined number of hash components, determining a similarity of the received block to the previously de-duplicated blocks based on a comparison of the hash components of the received block with the hash components in the set, and when the received block is determined as being similar to the previously processed blocks based on the comparison, storing the block without duplication in the de-duplication engine, including pages of the block referenced by hashes and a block descriptor.Type: ApplicationFiled: June 10, 2019Publication date: December 10, 2020Inventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Publication number: 20200387317Abstract: Disclosed herein are systems and method for building content for a de-duplication engine. In one aspect, an exemplary method comprises periodically receiving instructions for cycling through a coalescing phase and a sedimentation phase of the de-duplication engine, during a first coalescing phase, selecting a set of seed blocks that are similar to each other, when an instruction for proceeding to a next sedimentation phase is received, entering the sedimentation phase during which newly received blocks are processed to be stored near similar seed blocks, and when an instruction to proceed to a next coalescing phase is received, entering the coalescing phase to update the set of seed blocks.Type: ApplicationFiled: June 10, 2019Publication date: December 10, 2020Inventors: Oleg Volkov, Andrey Zaitsev, Kirill Korotaev, Serguei Beloussov, Stanislav Protasov
-
Publication number: 20070007281Abstract: Disclosed is a method for manufacturing thin sheets of high-strength titanium alloys. The method includes the steps of preparing initial blanks, assembling the initial blanks into a pack within a sheath, and heating and hot rolling the pack of the initial blanks in the sheath. The method is characterized in that, in the step of preparing the initial blanks, blanks having an (?-phase grain size of not more than 2 ?m are produced by hot rolling a forged or die-forged slab to a predetermined value of a relative thickness hB/hF, where hB is a thickness in mm of the initial blank before said pack hot rolling and hF is a final sheet thickness in mm, and by heat treating the initial blanks followed by rapidly cooling; and in that the step of pack hot rolling is conducted in quasi-isothermal conditions in longitudinal and transverse directions, while changing a rolling direction by about 90° after a predetermined total reduction in one direction is achieved.Type: ApplicationFiled: February 10, 2006Publication date: January 11, 2007Inventors: Vladislav Tetyukhin, Igor Levin, Alexander Kozlov, Andrey Zaitsev, Alexander Berestov