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).

  • Publication number: 20180016560
    Abstract: 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: Application
    Filed: July 20, 2017
    Publication date: January 18, 2018
    Inventors: Thomas Muster, Ekaterina Romanovskaya-Romanko, Oleg Kiselev, Markus Wolschek, Boris Ferko, Andrej Egorov
  • Patent number: 9771564
    Abstract: 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: Grant
    Filed: July 20, 2010
    Date of Patent: September 26, 2017
    Assignee: NANOTHERAPEUTICS, INC.
    Inventors: Thomas Muster, Ekaterina Romanovskaya-Romanko, Oleg Kiselev, Markus Wolschek, Boris Ferko, Andrej Egorov
  • Publication number: 20160342491
    Abstract: 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: Application
    Filed: August 8, 2016
    Publication date: November 24, 2016
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Patent number: 9430484
    Abstract: 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: Grant
    Filed: January 30, 2015
    Date of Patent: August 30, 2016
    Assignee: Hitachi, Ltd.
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Publication number: 20160188628
    Abstract: 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: Application
    Filed: March 9, 2016
    Publication date: June 30, 2016
    Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
  • Patent number: 9304821
    Abstract: 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: Grant
    Filed: November 17, 2014
    Date of Patent: April 5, 2016
    Assignee: HITACHI DATA SYSTEMS ENGINEERING UK LIMITED
    Inventors: David Stephen Hartman, Thomas Andrew Glass, Shantanu Sinha, Ben Bernhard, Oleg Kiselev, James Mattly
  • Patent number: 9235581
    Abstract: 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: Grant
    Filed: January 30, 2015
    Date of Patent: January 12, 2016
    Assignee: HITACHI DATA SYSTEMS ENGINEERING UK LIMITED
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Patent number: 9110719
    Abstract: 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: Grant
    Filed: November 7, 2014
    Date of Patent: August 18, 2015
    Assignee: Hitachi Data Systems Engineering UK Limited
    Inventors: David Stephen Hartman, Thomas Andrew Glass, Shantanu Sinha, Ben Bernhard, Oleg Kiselev, James Mattly
  • Patent number: 9069784
    Abstract: 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: Grant
    Filed: November 17, 2014
    Date of Patent: June 30, 2015
    Assignee: Hitachi Data Systems Engineering UK Limited
    Inventors: David Stephen Hartman, Thomas Andrew Glass, Shantanu Sinha, Ben Bernhard, Oleg Kiselev, James Mattly
  • Publication number: 20150149423
    Abstract: 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: Application
    Filed: January 30, 2015
    Publication date: May 28, 2015
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Publication number: 20150143066
    Abstract: 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: Application
    Filed: January 30, 2015
    Publication date: May 21, 2015
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Publication number: 20150121131
    Abstract: 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: Application
    Filed: December 29, 2014
    Publication date: April 30, 2015
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Patent number: 9021296
    Abstract: 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: Grant
    Filed: December 29, 2014
    Date of Patent: April 28, 2015
    Assignee: Hitachi Data Systems Engineering UK Limited
    Inventors: Oleg Kiselev, Gaurab Paul, Christopher Youngworth
  • Publication number: 20150088882
    Abstract: 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: Application
    Filed: November 17, 2014
    Publication date: March 26, 2015
    Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
  • Publication number: 20150089504
    Abstract: 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: Application
    Filed: November 17, 2014
    Publication date: March 26, 2015
    Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
  • Publication number: 20150074168
    Abstract: 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: Application
    Filed: November 7, 2014
    Publication date: March 12, 2015
    Inventors: David Stephen HARTMAN, Thomas Andrew GLASS, Shantanu SINHA, Ben BERNHARD, Oleg KISELEV, James MATTLY
  • Patent number: 8805886
    Abstract: 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: Grant
    Filed: May 26, 2004
    Date of Patent: August 12, 2014
    Assignee: Symantec Operating Corporation
    Inventors: Oleg Kiselev, John A. Colgrove
  • Patent number: 8495111
    Abstract: 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: Grant
    Filed: September 23, 2008
    Date of Patent: July 23, 2013
    Assignee: Symantec Corporation
    Inventors: Feng Wang, John A. Colgrove, Bo Hong, Oleg Kiselev
  • Patent number: 8401997
    Abstract: 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: Grant
    Filed: September 20, 2005
    Date of Patent: March 19, 2013
    Assignee: Symantec Operating Corporation
    Inventors: Deepak Tawri, Ronald S. Karr, John A. Colgrove, Raghu Krishnamurthy, Anand A. Kekre, Robert Baird, Oleg Kiselev
  • Publication number: 20120164175
    Abstract: 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: Application
    Filed: July 20, 2010
    Publication date: June 28, 2012
    Applicant: AVIR GREEN BIOTECHNOLOGY RESEARCH DEVELOPMENT TRAD
    Inventors: Thomas Muster, Ekaterina Romanovskaya-Romanko, Oleg Kiselev, Markus Wolschek, Boris Ferko, Andrej Egorov