Patents by Inventor Oleg Kiselev
Oleg Kiselev 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: 11663199Abstract: Systems and methods automatically generate a low input visualization of data updated in a workbook. One aspect describes a computer-implemented method comprising obtaining a request to update data in an application workbook for an application. The request comprises an indication of a type of update being requested and at least a subset of the data being updated. The method further comprises performing the update of the data in the application workbook and determining that the performed update of the data in the application workbook results in a change to a visualization of the data. The method also comprises generating an updated visualization based on the received request and the updated application workbook and generating a confirmation message that the updated visualization has been generated, wherein the updated visualization is generated automatically based on the update of the data.Type: GrantFiled: December 10, 2020Date of Patent: May 30, 2023Assignee: Amazon Technologies, Inc.Inventors: Oleg Kiselev, Arihant Sethia, Xiao Ma, Amit Agarwal, Rajesh Goli, Sapna Rai
-
Publication number: 20180016560Abstract: The present invention provides a novel influenza virus wherein both the NS and the PB1 gene segments are modified and wherein the PB1-F2 open reading frame is modified by introduction of at least one stop codon. Specifically, the influenza virus is lacking functional NS1 and PB1-F2 proteins. Additionally, a vaccine formulation comprising said modified influenza virus is provided and its use for prevention of influenza infection.Type: ApplicationFiled: July 20, 2017Publication date: January 18, 2018Inventors: Thomas Muster, Ekaterina Romanovskaya-Romanko, Oleg Kiselev, Markus Wolschek, Boris Ferko, Andrej Egorov
-
Patent number: 9771564Abstract: The present invention provides a novel influenza virus wherein both the NS and the PB1 gene segments are modified and wherein the PB1-F2 open reading frame is modified by introduction of at least one stop codon. Specifically, the influenza virus is lacking functional NS1 and PB1-F2 proteins. Additionally, a vaccine formulation comprising the modified influenza virus is provided and its use for prevention of influenza vaccination.Type: GrantFiled: July 20, 2010Date of Patent: September 26, 2017Assignee: NANOTHERAPEUTICS, INC.Inventors: Thomas Muster, Ekaterina Romanovskaya-Romanko, Oleg Kiselev, Markus Wolschek, Boris Ferko, Andrej Egorov
-
Publication number: 20160342491Abstract: In some examples, a system includes a plurality of nodes connected to one or more networks, and each of the nodes may include at least one processor and one or more storage devices. The system may be configured to store data, and redundancy data for the data, across the plurality of nodes in the system based at least in part on a redundancy policy. Further, each of the nodes may maintain configuration information that indicates a data placement of the data and the redundancy data on the plurality of nodes. In addition, each of the nodes may be configured to have a function to act as a first node which is configured to determine, upon a change of the redundancy policy, updated configuration information for the system based on the change of the redundancy policy.Type: ApplicationFiled: August 8, 2016Publication date: November 24, 2016Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Patent number: 9430484Abstract: A cluster system includes a plurality of computing nodes connected to a network, each node including one or more storage devices. The cluster system stores data and at least one of data replicas or erasure-coded segments across the plurality of nodes based on a redundancy policy. Further, configuration information, which may be indicative of a data placement of the data and the data replicas or erasure-coded segments on the plurality of nodes, is provided to each of the plurality of nodes. Additionally, each of the nodes may act as a first node which is configured to determine, upon a change of the redundancy policy, updated configuration information based on the change of the redundancy policy and to send a message including information indicating the change of the redundancy policy to the other nodes of the plurality of nodes.Type: GrantFiled: January 30, 2015Date of Patent: August 30, 2016Assignee: Hitachi, Ltd.Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Publication number: 20160188628Abstract: In some examples, a distributed system may include a plurality of nodes with a file stored in a file system across the plurality of nodes. One of the nodes may receive a request for location data corresponding to a part of the file. For instance, the location data may be included in a mapping file, and the request may specify an offset of the mapping file. The mapping file may include locations of nodes storing parts of the file in the file system across the plurality of nodes, and the mapping file may have a plurality of parts corresponding to the parts of the file. In response to the request, the node may access the mapping file and send location data corresponding to the offset of the mapping file. The location data may indicate at least one of the nodes storing the part of the file.Type: ApplicationFiled: March 9, 2016Publication date: June 30, 2016Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
-
Patent number: 9304821Abstract: In some examples, a distributed system may include a plurality of nodes with a file stored in a file system across the plurality of nodes. One of the nodes may receive a request for location data corresponding to a part of the file. For instance, the location data may be included in a mapping file, and the request may specify an offset of the mapping file. The mapping file may include locations of nodes storing parts of the file in the file system across the plurality of nodes, and the mapping file may have a plurality of parts corresponding to the parts of the file. In response to the request, the node may access the mapping file and send location data corresponding to the offset of the mapping file. The location data may indicate at least one of the nodes storing the part of the file.Type: GrantFiled: November 17, 2014Date of Patent: April 5, 2016Assignee: HITACHI DATA SYSTEMS ENGINEERING UK LIMITEDInventors: David Stephen Hartman, Thomas Andrew Glass, Shantanu Sinha, Ben Bernhard, Oleg Kiselev, James Mattly
-
Patent number: 9235581Abstract: A cluster system includes a plurality of computing nodes connected to a network. Each node is configured to access its own storage device, and to send and receive input/output (I/O) operations associated with its own storage device. Further, each node of the plurality of nodes may be configured to have a function of acting as a first node, which sends a first message to other nodes of the plurality of nodes. The first message may include configuration information indicative of a data placement of data on the plurality of nodes in the cluster system according to an event. Following receipt of the first message from the first node, each of the other nodes may be configured to determine, based at least in part on the configuration information, whether data stored on its own storage device is affected by the event.Type: GrantFiled: January 30, 2015Date of Patent: January 12, 2016Assignee: HITACHI DATA SYSTEMS ENGINEERING UK LIMITEDInventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Patent number: 9110719Abstract: A distributed system includes a plurality of nodes connected over a network. Each node has a unique node identifier which identifies the node in the distributed system. Tasks are launched from any node in the distributed system and include one or more node identifiers. If a node receives a task including its node identifier, the node executes the task. Each node may store each task in a log. If a node fails, after recovering from the failure, the node queries the distributed system for tasks which were not received and tasks which were not completed due to the failure.Type: GrantFiled: November 7, 2014Date of Patent: August 18, 2015Assignee: Hitachi Data Systems Engineering UK LimitedInventors: David Stephen Hartman, Thomas Andrew Glass, Shantanu Sinha, Ben Bernhard, Oleg Kiselev, James Mattly
-
Patent number: 9069784Abstract: In some examples, a node in a distributed system may receive one or more IP addresses for use with one or more virtual machines. For example, at least one of the received IP addresses may be encoded into a respective MAC address. Further, a hypervisor implemented on the node may configure a virtual machine on the node. For instance, configuring the virtual machine may include passing the encoded MAC address to the virtual machine through the hypervisor. The virtual machine may be configured to decode the IP address from the encoded MAC address, and the IP address is assigned to the virtual machine.Type: GrantFiled: November 17, 2014Date of Patent: June 30, 2015Assignee: Hitachi Data Systems Engineering UK LimitedInventors: David Stephen Hartman, Thomas Andrew Glass, Shantanu Sinha, Ben Bernhard, Oleg Kiselev, James Mattly
-
Publication number: 20150149423Abstract: A cluster system includes a plurality of computing nodes connected to a network, each node including one or more storage devices. The cluster system stores data and at least one of data replicas or erasure-coded segments across the plurality of nodes based on a redundancy policy. Further, configuration information, which may be indicative of a data placement of the data and the data replicas or erasure-coded segments on the plurality of nodes, is provided to each of the plurality of nodes. Additionally, each of the nodes may act as a first node which is configured to determine, upon a change of the redundancy policy, updated configuration information based on the change of the redundancy policy and to send a message including information indicating the change of the redundancy policy to the other nodes of the plurality of nodes.Type: ApplicationFiled: January 30, 2015Publication date: May 28, 2015Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Publication number: 20150143066Abstract: A cluster system includes a plurality of computing nodes connected to a network. Each node is configured to access its own storage device, and to send and receive input/output (I/O) operations associated with its own storage device. Further, each node of the plurality of nodes may be configured to have a function of acting as a first node, which sends a first message to other nodes of the plurality of nodes. The first message may include configuration information indicative of a data placement of data on the plurality of nodes in the cluster system according to an event. Following receipt of the first message from the first node, each of the other nodes may be configured to determine, based at least in part on the configuration information, whether data stored on its own storage device is affected by the event.Type: ApplicationFiled: January 30, 2015Publication date: May 21, 2015Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Publication number: 20150121131Abstract: A storage system includes a plurality of nodes connected to a network. Each node is capable of performing its own recovery of partially written data and maintaining consistency of the data stored on the storage system. The nodes may independently calculate the location of the data across the nodes and independently balance the data, maintain consistency based on a redundancy policy of the storage system, and migrate data according to a location change. If a node determines that the stored data thereon is incomplete or damaged, the node may reconstruct its respective data from replica data on other nodes. During migration of data between the nodes, I/O processing from a host is not interrupted in some examples.Type: ApplicationFiled: December 29, 2014Publication date: April 30, 2015Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Patent number: 9021296Abstract: A storage system includes a plurality of nodes connected to a network. Each node is capable of performing its own recovery of partially written data and maintaining consistency of the data stored on the storage system. The nodes may independently calculate the location of the data across the nodes and independently balance the data, maintain consistency based on a redundancy policy of the storage system, and migrate data according to a location change. If a node determines that the stored data thereon is incomplete or damaged, the node may reconstruct its respective data from replica data on other nodes. During migration of data between the nodes, I/O processing from a host is not interrupted in some examples.Type: GrantFiled: December 29, 2014Date of Patent: April 28, 2015Assignee: Hitachi Data Systems Engineering UK LimitedInventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
-
Publication number: 20150089504Abstract: In some examples, a node in a distributed system may receive one or more IP addresses for use with one or more virtual machines. For example, at least one of the received IP addresses may be encoded into a respective MAC address. Further, a hypervisor implemented on the node may configure a virtual machine on the node. For instance, configuring the virtual machine may include passing the encoded MAC address to the virtual machine through the hypervisor. The virtual machine may be configured to decode the IP address from the encoded MAC address, and the IP address is assigned to the virtual machine.Type: ApplicationFiled: November 17, 2014Publication date: March 26, 2015Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
-
Publication number: 20150088882Abstract: In some examples, a distributed system may include a plurality of nodes with a file stored in a file system across the plurality of nodes. One of the nodes may receive a request for location data corresponding to a part of the file. For instance, the location data may be included in a mapping file, and the request may specify an offset of the mapping file. The mapping file may include locations of nodes storing parts of the file in the file system across the plurality of nodes, and the mapping file may have a plurality of parts corresponding to the parts of the file. In response to the request, the node may access the mapping file and send location data corresponding to the offset of the mapping file. The location data may indicate at least one of the nodes storing the part of the file.Type: ApplicationFiled: November 17, 2014Publication date: March 26, 2015Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
-
Publication number: 20150074168Abstract: A distributed system includes a plurality of nodes connected over a network. Each node has a unique node identifier which identifies the node in the distributed system. Tasks are launched from any node in the distributed system and include one or more node identifiers. If a node receives a task including its node identifier, the node executes the task. Each node may store each task in a log. If a node fails, after recovering from the failure, the node queries the distributed system for tasks which were not received and tasks which were not completed due to the failure.Type: ApplicationFiled: November 7, 2014Publication date: March 12, 2015Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
-
Patent number: 8805886Abstract: A log manager may store a validation indicator with each data block of a log entry. The log manager may create a header block for each log entry that may include a validation indicator or tag. Such a validation indicator may be stored within the metadata for each data block. The validation indicator may additionally be stored in the metadata for the header block and it may be stored in header block itself. When recovering such a log, according to some embodiments, the validation indicators for each data block are checked against the validation indicator in the header block.Type: GrantFiled: May 26, 2004Date of Patent: August 12, 2014Assignee: Symantec Operating CorporationInventors: Oleg Kiselev, John A. Colgrove
-
Patent number: 8495111Abstract: A system and method for storing data. In one embodiment, a storage system includes a resource manager and a hierarchical entry tree describing storage entities of the storage system. At each given level of the tree higher than the bottom level, metadata entries summarize storage availability at a level below the given level. The resource manager receives a request to store data of a target size at a target location corresponding to a first portion of the entry tree and scans the entry tree to determine if contiguous, free storage entities of the target size are available at the target location. In response to determining that contiguous, free storage entities of the target size are not available at the target location, the resource manager scans portions of the entry tree outside the first portion to identify contiguous, free storage entities of the target size, where it stores the data.Type: GrantFiled: September 23, 2008Date of Patent: July 23, 2013Assignee: Symantec CorporationInventors: Feng Wang, John A. Colgrove, Bo Hong, Oleg Kiselev
-
Patent number: 8401997Abstract: Applications executing on various nodes in a distributed storage environment may write data to primary storage and may also replicate the data to secondary storage via a replication target. An interval coordinator may coordinate the periodic saving of checkpoints or snapshots of the replicated data. The interval coordinator may determine the length of consistency intervals between the saving of each of the checkpoints. Writes to the replication target from each of the nodes may be associated with the current consistency interval and, in some embodiments, with a unique per-node sequence number. When transitioning between consistency intervals, each node may be configured to temporarily suspend completion of the writes and to send the replication target a consistency interval marker indicating that the node has completed all writes for the current consistency interval.Type: GrantFiled: September 20, 2005Date of Patent: March 19, 2013Assignee: Symantec Operating CorporationInventors: Deepak Tawri, Ronald S. Karr, John A. Colgrove, Raghu Krishnamurthy, Anand A. Kekre, Robert Baird, Oleg Kiselev