Acronis Assigned Two Patents

Using data blocks to optimize file storage
Acronis International GmbH, Schaffhausen, Switzerland, has been assigned a patent (10,747,724) developed by Sergeev, Alexei, Khalyapin, Alexander, Shmulevich, Mark, Protasov, Stanislav, Moscow, Russia, and Beloussov, Serguei M., Costa del Sol, Singapore, for “system and method of using data blocks to optimize file storage.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A system and method is disclosed for using data blocks to optimize file storage in electronic data storage. An example method includes storing data objects in a storage service that correspond to a main block and multiple secondary blocks. The main block is stored in a first bucket and the secondary blocks are stored in one or more second buckets, with the main block including metadata indicating a unique identifier of the second bucket. The method further includes receiving a request to delete the data file to free storage, marking the main block of the data file for deletion that prevents a reading operation or a writing operation of additional data to the data file, deleting the secondary blocks of the data file, and after the secondary blocks are deleted, deleting the marked main block of the data file.”

The patent application was filed on December 19, 2017 (15/846,308).

Scheduling and allocating data storage
Acronis International GmbH, Schaffhausen, Switzerland, has been assigned a patent (10,725,819) developed by Bykov, Sergey, Aseev, Eugene, Moscow, Russia, Solanki, Sanjeev, Singapore, Singapore, Beloussov, Serguei, Costa Del Sol, Singapore, and Protasov, Stanislav, Moscow, Russia, for “system and method for scheduling and allocating data storage.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A system and method is disclosed for scheduling and allocating data storage. An example method comprises generating a scheduling problem based at least on states of each of the plurality of storage nodes, a received plurality of storage tasks and received constraints, wherein the scheduling problem is a constraint satisfaction problem, selecting one or more approaches to solving the scheduling problem based on metadata associated with the storage tasks and constraints, solving the scheduling problem to generate a scheduling solution based on the one or more approaches, determining whether the given constraints are satisfied by the scheduling solution, executing, by the processor, the scheduling solution by assigning storage of data to each of the plurality of storage nodes when the constraints are satisfied by the scheduling solution and determining another scheduling solution based on the one or more approaches when the constraints are not satisfied by the scheduling solution.”

The patent application was filed on May 18, 2018 (15/983,245)