Acronis International Gmbh

Ao Kaspersky Lab

Virtuozzo International Gmbh

Parallels International Gmbh

Parallels IP Holdings Gmbh

Oleg P Volkov

Serguei M Beloussov

Kirill Korotaev

Andrey Zaitsev

Stanislav Protasov

Alexey Kuznetzov

Stanislav S Protassov

Alexey Kobets

Konstantin M Filatov

Vladimir A Kuskov

Anton A Kivva

Nikita A Buchka

Dmitry Y Lukasevich

Evgeny A Roginsky

Dmitry V Latokhin

Pavel Emelyanov

Yuri Per

Andrey Zaytsev

Ludmila Ivanichkina

Alexey Kuznetsov

Disclosed herein are systems and methods for categorizing an application on a computing device including gathering a set of attributes of an application. The set of attributes of the application includes at least one of: a number of files in an application package of the application; a number of executable files in the application package; numbers and types of permissions being requested; a number of classes in the executable files in the application package; and a number of methods in the executable files in the application package. sending the gathered set of attributes to a trained classification model. The application is classified, using the classification model, based on the gathered set of attributes by generating one or more probabilities of the application belonging to respective one or more categories of applications. A category of the application is determined based on the generated one or more probabilities.

System and method of categorization of an application on a computing device using a classifier

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.

Systems and methods for optimized re-striping in an erasure encoded storage

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.

Systems and methods for a scalable de-duplication engine

Disclosed herein are systems and methods for categorizing an application on a computing device. In one aspect, an exemplary method comprises, obtaining results of a classification of an application from a security server, when the results of the classification satisfy rules of relevance, designating the results of the classification as relevant and determining a category of the application based on the designation of the results as relevant, and when the results of the classification do not satisfy the rules of relevance, performing at least one of: terminating the categorization of the application, and updating the classification of the application based on a set of attributes of the application.

System and method of categorization of an application on a computing device

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.

Methods and systems for de-duplicating blocks of data

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.

Method and system for building content for a de-duplication engine

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.

Methods and systems for providing read-optimized scalable offline de-duplication for blocks of data

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.

System and method for fast random access erasure encoded storage

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.

Method for writing objects into an object storage. Performing, on a protocol end point: receiving a client request for inserting an object into the object storage, wherein the object has a name and object data; generating a unique ID (UID) for the object; sending, to a name server (NS), a request for creating a guard entry (GE). The GE has a lifetime that defines when the name-object pair is inserted into the object storage. A request to an object server (OS) atomically creates a Garbage Collection Entry and assigns space for the object data. The GCE has a lifetime that defines when the object data is inserted into the object storage; sending, to the OS, object data for writing to storage; sending, to the NS, a request for writing the name; and sending response to the client, to report success after requests to the NS and the OS are successful.

Management of garbage data in distributed systems

A method and a system for cache management in system interfacing to a cloud storage. The cache has two layers: the filter layer for tracing read access to the data blocks and the cache layer for keeping the actual data blocks. The layer two consists of two modules&#x2014;a main cache and a boot cache. The boot cache is filled during the short period of time after the first file open operation. The boot cache also has a limit on the amount of data that can be put into the cache for the particular file. The filter layer detects continuous read access pattern and avoids caching data, if the data is read continuously beyond some limit.

Growing community of inventors

Moscow, Russia

Oleg P Volkov