Patents by Inventor David Hadas

David Hadas 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: 10255140
    Abstract: A globally distributed scan list is determined. A determination is made whether the first data replica in the first plurality of data stored on a first device is in sync with a second data replica in the second plurality of data on a second device. In response to determining that the first data replica is not in sync with the second data replica, the first data replica is added to an unsynced queue. The neighbor data of the first plurality of data is added to a suspect queue. The priority to check the neighbor data is increased if the neighbor data is already in the suspect queue. Unsynced neighbor data is added to the unsynced queue. The priority for recovery of the data in the unsynced queue is determined. The priority is based on the vulnerability of the data. A data replica in the unsynced queue is recovered.
    Type: Grant
    Filed: April 10, 2017
    Date of Patent: April 9, 2019
    Assignee: International Business Machines Corporation
    Inventors: David Hadas, Dmitry Sotnikov, Paula K. Ta-Shma
  • Patent number: 10216581
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Grant
    Filed: December 9, 2015
    Date of Patent: February 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Patent number: 10210047
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Grant
    Filed: December 9, 2015
    Date of Patent: February 19, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Patent number: 10176050
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Grant
    Filed: December 9, 2015
    Date of Patent: January 8, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Patent number: 10169159
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Grant
    Filed: December 9, 2015
    Date of Patent: January 1, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Patent number: 10164868
    Abstract: A physical host executes a virtual machine monitor (VMM) that instantiates a source virtual machine (VM). In response to the VMM receiving from the source VM a packet specifying a first destination address of a destination VM and a second destination address of a default gateway, the VMM determines whether the packet can be communicated to the destination VM without the packet being routed by the default gateway. In response to the VMM determining that the packet can be communicated to the destination VM without the packet being routed by the default gateway, the VMM forwards the packet to the destination VM such that the packet bypasses routing by the default gateway.
    Type: Grant
    Filed: April 26, 2012
    Date of Patent: December 25, 2018
    Assignee: International Business Machines Corporation
    Inventors: Robert Cowart, David Hadas, Daniel J. Martin, Bruce Ratcliff, Renato Recio
  • Patent number: 10142218
    Abstract: A physical host executes a virtual machine monitor (VMM) that instantiates a source virtual machine (VM). In response to the VMM receiving from the source VM a packet specifying a first destination address of a destination VM and a second destination address of a default gateway, the VMM determines whether the packet can be communicated to the destination VM without the packet being routed by the default gateway. In response to the VMM determining that the packet can be communicated to the destination VM without the packet being routed by the default gateway, the VMM forwards the packet to the destination VM such that the packet bypasses routing by the default gateway.
    Type: Grant
    Filed: January 14, 2011
    Date of Patent: November 27, 2018
    Assignee: International Business Machines Corporation
    Inventors: Robert Cowart, David Hadas, Daniel J. Martin, Bruce Ratcliff, Renato Recio
  • Publication number: 20170212813
    Abstract: A globally distributed scan list is determined. A determination is made whether the first data replica in the first plurality of data stored on a first device is in sync with a second data replica in the second plurality of data on a second device. In response to determining that the first data replica is not in sync with the second data replica, the first data replica is added to an unsynced queue. The neighbor data of the first plurality of data is added to a suspect queue. The priority to check the neighbor data is increased if the neighbor data is already in the suspect queue. Unsynced neighbor data is added to the unsynced queue. The priority for recovery of the data in the unsynced queue is determined. The priority is based on the vulnerability of the data. A data replica in the unsynced queue is recovered.
    Type: Application
    Filed: April 10, 2017
    Publication date: July 27, 2017
    Inventors: David Hadas, Dmitry Sotnikov, Paula K. Ta-Shma
  • Patent number: 9665446
    Abstract: A globally distributed scan list is determined. A determination is made whether the first data replica in the first plurality of data stored on a first device is in sync with a second data replica in the second plurality of data on a second device. In response to determining that the first data replica is not in sync with the second data replica, the first data replica is added to an unsynced queue. The neighbor data of the first plurality of data is added to a suspect queue. The priority to check the neighbor data is increased if the neighbor data is already in the suspect queue. Unsynced neighbor data is added to the unsynced queue. The priority for recovery of the data in the unsynced queue is determined. The priority is based on the vulnerability of the data. A data replica in the unsynced queue is recovered.
    Type: Grant
    Filed: December 29, 2015
    Date of Patent: May 30, 2017
    Assignee: International Business Machines Corporation
    Inventors: David Hadas, Dmitry Sotnikov, Paula K. Ta-Shma
  • Patent number: 9646019
    Abstract: Machines, systems and methods for handling a client request in a hierarchical multi-tenant data storage system, the method comprising processing a request in subtasks, wherein a subtask is executed with a minimal set of privileges associated with a specific subtenant; extracting a claimed n-level hierarchy of a tenant and sub-tenant identities from the request; extracting authentication signatures or credentials that correspond to a level in the hierarchy; for a first level in the hierarchy, sending the request to a dedicated subtenant authenticator with privilege to validate credentials for a subtenant at the first level; and receiving a confirmation from the dedicated subtenant authenticator, whether the request is authentic.
    Type: Grant
    Filed: May 17, 2016
    Date of Patent: May 9, 2017
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner, Anil Kurmus, Alexandra Shulman-Peleg, Alessandro Sorniotti
  • Publication number: 20160259807
    Abstract: Machines, systems and methods for handling a client request in a hierarchical multi-tenant data storage system, the method comprising processing a request in subtasks, wherein a subtask is executed with a minimal set of privileges associated with a specific subtenant; extracting a claimed n-level hierarchy of a tenant and sub-tenant identities from the request; extracting authentication signatures or credentials that correspond to a level in the hierarchy; for a first level in the hierarchy, sending the request to a dedicated subtenant authenticator with privilege to validate credentials for a subtenant at the first level; and receiving a confirmation from the dedicated subtenant authenticator, whether the request is authentic.
    Type: Application
    Filed: May 17, 2016
    Publication date: September 8, 2016
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner, Anil Kurmus, Alexandra Shulman-Peleg, Alessandro Sorniotti
  • Patent number: 9411973
    Abstract: Machines, systems and methods for handling a client request in a hierarchical multi-tenant data storage system, the method comprising processing a request in subtasks, wherein a subtask is executed with a minimal set of privileges associated with a specific subtenant; extracting a claimed n-level hierarchy of a tenant and sub-tenant identities from the request; extracting authentication signatures or credentials that correspond to a level in the hierarchy; for a first level in the hierarchy, sending the request to a dedicated subtenant authenticator with privilege to validate credentials for a subtenant at the first level; and receiving a confirmation from the dedicated subtenant authenticator, whether the request is authentic.
    Type: Grant
    Filed: May 2, 2013
    Date of Patent: August 9, 2016
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner, Anil Kurmus, Alexandra Shulman-Peleg, Alessandro Sorniotti
  • Patent number: 9372722
    Abstract: Machines, systems and methods for processing a request in a client-server computing environment are provided. In one embodiment, the method comprises receiving from a client a request submitted to a server for purpose of synchronous processing by the server; assigning the request to a first thread for processing; registering the request with a request registration system, wherein the request is assigned to the first thread for processing, in response to determining that the request is acceptable and may be processed synchronously, wherein the request is unregistered from the request registration system, in response to determining that the first thread completed processing of the request within a first timeline, and wherein an alternative thread is assigned for processing the request asynchronously, in response to determining that the first thread did not complete processing of the request within the first timeline.
    Type: Grant
    Filed: July 1, 2013
    Date of Patent: June 21, 2016
    Assignee: International Business Machines Corporation
    Inventors: Michel E Factor, David Hadas, Elliot K Kolodner
  • Publication number: 20160085651
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Application
    Filed: December 9, 2015
    Publication date: March 24, 2016
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Publication number: 20160085652
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Application
    Filed: December 9, 2015
    Publication date: March 24, 2016
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Publication number: 20160085632
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Application
    Filed: December 9, 2015
    Publication date: March 24, 2016
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Publication number: 20160085633
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Application
    Filed: December 9, 2015
    Publication date: March 24, 2016
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Patent number: 9264494
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Grant
    Filed: October 21, 2013
    Date of Patent: February 16, 2016
    Assignee: International Business Machines Corporation
    Inventors: Michael E Factor, David Hadas, Elliot K Kolodner
  • Patent number: 9223626
    Abstract: Machines, systems and methods for task management in a computer implemented system. The method comprises registering a task with brokers residing on one or more nodes to manage the execution of a task to completion, wherein a first broker is accompanied by a first set of worker threads co-located on the node on which the first broker is executed, wherein the first broker assigns responsibility of execution for the task to the one or more worker threads in the first set of co-located worker threads, wherein in response to a failure associated with a first worker thread in the first set, the first broker reassigns the responsibility of execution for the task to a second worker thread in the first set, wherein in response to a failure associated with the first broker, a second broker assigns responsibility of execution for the task to one or more co-located worker threads.
    Type: Grant
    Filed: August 30, 2012
    Date of Patent: December 29, 2015
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, David Hadas, Elliot K. Kolodner
  • Publication number: 20150113324
    Abstract: Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.
    Type: Application
    Filed: October 21, 2013
    Publication date: April 23, 2015
    Applicant: International Business Machines Corporation
    Inventors: Michael E Factor, David Hadas, Elliot K Kolodner