Patents by Inventor Erez Webman

Erez Webman 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: 8150800
    Abstract: An advanced clock synchronization technique is adapted for use with a replication service in a data backup and recovery storage environment. The storage environment includes a plurality of source storage systems and target storage systems, wherein the source storage systems are illustratively embodied as source replication nodes. The advanced clock synchronization technique establishes a software-only, loosely-accurate global clock based on a timestamp and an associated error boundary. Notably, the timestamp and its error boundary are used as global clock information to enable synchronization (i.e., ordering of storage requests) among the source replication nodes and/or the target storage systems, thereby ensuring consistent replication of the storage requests on the target storage systems.
    Type: Grant
    Filed: March 28, 2007
    Date of Patent: April 3, 2012
    Assignee: NetApp, Inc.
    Inventors: Erez Webman, Yoram Novick
  • Patent number: 8099396
    Abstract: A system and method enhances performance of a log adapted for use with a storage system. The log is illustratively organized into a plurality of regions, wherein each region comprises one or more entries and wherein each region is allocated to a consistency collection. As used herein, a consistency collection is defined as a set of one or more data containers among which it is desired to maintain transaction consistency, i.e., atomicity of updates of a transaction to those containers. Each entry of the region is adapted to store an update of data from a source, e.g., an application executing on the storage system. Thus, the consistency collection may comprise multiple data containers associated with one or more applications configured to maintain the atomicity of transaction updates to the collection of containers.
    Type: Grant
    Filed: October 9, 2009
    Date of Patent: January 17, 2012
    Assignee: NetApp, Inc.
    Inventors: Yoram Novick, Erez Webman
  • Patent number: 8037171
    Abstract: Provided are a system, program, and data structure for selecting one of multiple data paths to a device. A selection is made of one of multiple paths indicated as enabled to transmit data. A path is indicated as enabled or disabled. Transfer time data is gathered for each enabled path capable of being selected. Paths having transfer time data satisfying a threshold are indicated as disabled. Paths indicated as disabled are not capable of being selected to use to transmit data.
    Type: Grant
    Filed: May 9, 2008
    Date of Patent: October 11, 2011
    Assignee: International Business Machines Corporation
    Inventors: David Alan Burton, Robert Louis Morton, Erez Webman
  • Patent number: 7925629
    Abstract: A write ordering style asynchronous replication service utilizes a loosely-accurate global clock in a data backup and recovery storage environment. The storage environment includes a set of source storage systems illustratively embodied as source replication nodes that cooperate to maintain a consistency group that may span multiple geographical sites. The storage environment also includes one or more target storage systems illustratively embodied as target replication nodes configured to service the consistency group. The write ordering style service utilizes the loosely-accurate global clock to provide consistent replication of a storage space of the consistency group.
    Type: Grant
    Filed: March 28, 2007
    Date of Patent: April 12, 2011
    Assignee: NetApp, Inc.
    Inventors: Erez Webman, Yoram Novick, Dvir Koren
  • Patent number: 7693886
    Abstract: A delta query technique transmits only latest changes to data of objects from a server to one or more clients in response to a client query (request) to access the object data. A global counter is maintained for all of the objects served by the server. Every time the data of an object changes, a value of the global counter increments (updates) and the updated global counter value is then assumed (“inherited”) by that object. In addition, the global counter is updated when a client issues a request to access one or more objects. If the data of the objects has changed since the last time the client accessed the objects, the server responds with the latest object data and the updated global counter value. Notably, each client maintains a local counter having a value that, upon receipt of the latest object data, is modified to reflect the updated global counter value.
    Type: Grant
    Filed: December 15, 2006
    Date of Patent: April 6, 2010
    Assignee: NetApp, Inc.
    Inventors: Yoram Novick, Erez Webman, Orly Devor
  • Patent number: 7620669
    Abstract: A system and method enhances performance of a log adapted for use with a storage system. The log is illustratively organized into a plurality of regions, wherein each region comprises one or more entries and wherein each region is allocated to a consistency collection. As used herein, a consistency collection is defined as a set of one or more data containers among which it is desired to maintain transaction consistency, i.e., atomicity of updates of a transaction to those containers. Each entry of the region is adapted to store an update of data from a source, e.g., an application executing on the storage system. Thus, the consistency collection may comprise multiple data containers associated with one or more applications configured to maintain the atomicity of transaction updates to the collection of containers.
    Type: Grant
    Filed: December 15, 2006
    Date of Patent: November 17, 2009
    Assignee: NetApp, Inc.
    Inventors: Yoram Novick, Erez Webman
  • Publication number: 20080243952
    Abstract: A group stamping style asynchronous replication service utilizes a loosely-accurate global clock in a data backup and recovery storage environment. The storage environment includes a set of source storage systems illustratively embodied as source replication nodes that cooperate to maintain a consistency group that may span multiple geographical sites. The storage environment also includes one or more target storage systems illustratively embodied as target replication nodes configured to service the consistency group. The group stamping style service utilizes the loosely-accurate global clock to provide consistent replication of a storage space, e.g., a target storage space, of the consistency group.
    Type: Application
    Filed: March 28, 2007
    Publication date: October 2, 2008
    Inventors: Erez Webman, Danit Segev, Yigal Eisinger
  • Publication number: 20080243951
    Abstract: A write ordering style asynchronous replication service utilizes a loosely-accurate global clock in a data backup and recovery storage environment. The storage environment includes a set of source storage systems illustratively embodied as source replication nodes that cooperate to maintain a consistency group that may span multiple geographical sites. The storage environment also includes one or more target storage systems illustratively embodied as target replication nodes configured to service the consistency group. The write ordering style service utilizes the loosely-accurate global clock to provide consistent replication of a storage space of the consistency group.
    Type: Application
    Filed: March 28, 2007
    Publication date: October 2, 2008
    Inventors: Erez Webman, Yoram Novick, Dvir Koren
  • Publication number: 20080243950
    Abstract: An advanced clock synchronization technique is adapted for use with a replication service in a data backup and recovery storage environment. The storage environment includes a plurality of source storage systems and target storage systems, wherein the source storage systems are illustratively embodied as source replication nodes. The advanced clock synchronization technique establishes a software-only, loosely-accurate global clock based on a timestamp and an associated error boundary. Notably, the timestamp and its error boundary are used as global clock information to enable synchronization (i.e., ordering of storage requests) among the source replication nodes and/or the target storage systems, thereby ensuring consistent replication of the storage requests on the target storage systems.
    Type: Application
    Filed: March 28, 2007
    Publication date: October 2, 2008
    Inventors: Erez Webman, Yoram Novick
  • Publication number: 20080205301
    Abstract: Provided are a system, program, and data structure for selecting one of multiple data paths to a device. A selection is made of one of multiple paths indicated as enabled to transmit data. A path is indicated as enabled or disabled. Transfer time data is gathered for each enabled path capable of being selected. Paths having transfer time data satisfying a threshold are indicated as disabled. Paths indicated as disabled are not capable of being selected to use to transmit data.
    Type: Application
    Filed: May 9, 2008
    Publication date: August 28, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David Alan Burton, Robert Louis Morton, Erez Webman
  • Patent number: 7404005
    Abstract: Disclosed is a method, system, program, and data structure for selecting one of multiple data paths to a device. A selection is made of one of multiple paths indicated as enabled to transmit data. A path is indicated as enabled or disabled. Transfer time data is gathered for each enabled path capable of being selected. Paths having transfer time data satisfying a threshold are indicated as disabled. Paths indicated as disabled are not capable of being selected to use to transmit data.
    Type: Grant
    Filed: June 9, 2000
    Date of Patent: July 22, 2008
    Assignee: International Business Machines Corporation
    Inventors: David Alan Burton, Robert Louis Morton, Erez Webman
  • Patent number: 7143176
    Abstract: A method for copying data over a network operating in accordance with a protocol, such as the ESCON protocol, that supports a given logical address range includes establishing a logical path over the network from a primary storage system to a secondary storage system using path logical addresses within the given logical address range. A virtual path is created over the logical path to carry the data from a source storage device in a first logical subsystem of the primary storage system to a target storage device in a second logical subsystem of the secondary storage system, wherein the first and second logical subsystems have respective first and second subsystem logical addresses which are outside the given logical address range. The virtual path is used in a peer-to-peer remote copy (PPRC) operation to copy the data from the source storage device to the target storage device.
    Type: Grant
    Filed: November 6, 2001
    Date of Patent: November 28, 2006
    Assignee: International Business Machines Corporation
    Inventors: Olympia Gluck, Gilad Sharaby, Gabriel Walder, Erez Webman
  • Patent number: 6738865
    Abstract: Disclosed is a method, system, and program for caching data. Data from a device, such as a volatile memory device or non-volatile storage device, is maintained in entries in a cache. For each entry in cache, a variable indicates both a time when the cache entry was last accessed and a frequency of accesses to the cache entry. The variable is used in determining which entry to denote from cache to make room for subsequent entries.
    Type: Grant
    Filed: June 9, 2000
    Date of Patent: May 18, 2004
    Assignee: International Business Machines Corporation
    Inventors: David Alan Burton, Erez Webman
  • Patent number: 6732193
    Abstract: Disclosed is a method, system, program, and data structure for executing write operations. A first number of write operations is initiated. Performance data is gathered indicating a total time for a second number of the initiated write operations to complete. After at least one initiated write operation has completed, at least one additional write operation is initiated if a number of outstanding write operations is less than a maximum number of write operations. The maximum number of write operations is adjusted if the performance data meets at least one threshold.
    Type: Grant
    Filed: June 9, 2000
    Date of Patent: May 4, 2004
    Assignee: International Business Machines Corporation
    Inventors: David Alan Burton, Robert Louis Morton, Erez Webman
  • Patent number: 6678787
    Abstract: System for the storage and maintenance of data sets updates in a storage subsystem, that comprises direct access storage device(s) that serves as the main storage of the storage subsystem and on which the data sets are originally stored; a Cache memory storage device that enables fast interaction with the storage subsystem, on which a copy of the data sets is stored; a non-volatile storage device partitioned into a plurality of fixed size non-volatile memory pages.
    Type: Grant
    Filed: December 21, 2000
    Date of Patent: January 13, 2004
    Assignee: International Business Machines Corporation
    Inventors: Yael Petruschka, Erez Webman, Yoram Novick, Tal Sivan
  • Publication number: 20030088638
    Abstract: A method for copying data over a network operating in accordance with a protocol, such as the ESCON protocol, that supports a given logical address range includes establishing a logical path over the network from a primary storage system to a secondary storage system using path logical addresses within the given logical address range. A virtual path is created over the logical path to carry the data from a source storage device in a first logical subsystem of the primary storage system to a target storage device in a second logical subsystem of the secondary storage system, wherein the first and second logical subsystems have respective first and second subsystem logical addresses which are outside the given logical address range. The virtual path is used in a peer-to-peer remote copy (PPRC) operation to copy the data from the source storage device to the target storage device.
    Type: Application
    Filed: November 6, 2001
    Publication date: May 8, 2003
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Olympia Gluck, Gilad Sharaby, Gabriel Walder, Erez Webman
  • Patent number: 6526419
    Abstract: Disclosed is a method, system, program, and data structure for providing a shadow copy of data storage areas in a primary site to data storage areas in a secondary site. A definition is made of storage areas in the primary site having data to be shadowed and corresponding storage areas in the secondary site to shadow data at the storage areas in the primary site. A shadow pair comprises one primary storage area and one secondary storage area that shadows data for the primary storage area in the pair. A standard data transfer interface protocol command, such as a SCSI or Fibre Channel command, is used to configure status storage areas in the secondary site to provide status information and data for each primary and secondary storage area. A write command in the standard data transfer interface protocol is then used to write status information to the status storage areas indicating status of the shadowed data at the secondary storage areas in the pairs.
    Type: Grant
    Filed: June 9, 2000
    Date of Patent: February 25, 2003
    Assignee: International Business Machines Corporation
    Inventors: David Alan Burton, Robert Louis Morton, Erez Webman
  • Publication number: 20020083263
    Abstract: System for the storage and maintenance of data sets updates in a storage subsystem, that comprises direct an access storage device(s) that serves as the main storage of the storage subsystem and on which the data sets are originally stored; a Cache memory storage device that enables fast interaction with the storage subsystem, on which a copy of the data sets is stored; a non-volatile storage device partitioned into a plurality of fixed size non-volatile memory pages.
    Type: Application
    Filed: December 21, 2000
    Publication date: June 27, 2002
    Inventors: Yael Petruschka, Erez Webman, Yoram Novick, Tal Sivan