Patents by Inventor Shachar Fienblit

Shachar Fienblit 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: 7702953
    Abstract: Provided are a method, system, and article of manufacture, wherein synchronous replication of data is initiated from a first site to a second site. At least one part of the data is sent asynchronously from the second site to a third site, wherein the asynchronously sent at least one part of the data is stored at the second site while the at least one part of data is in flight from the second site to the third site. The at least one part of the data stored at the second site is deleted, in response to the at least one part of the data being securely stored at the third site.
    Type: Grant
    Filed: January 4, 2007
    Date of Patent: April 20, 2010
    Assignee: International Business Machines Corporation
    Inventors: Gail Andrea Spear, Michael E. Fractor, Shachar Fienblit
  • Publication number: 20100077142
    Abstract: Preparation of a snapshot for data storage includes receiving a first command to prepare to create a snapshot of a set of data stored on at least one source storage volume in a data storage system. The data storage system is prepared to expedite creation of the snapshot in response to the first command. A second command to create the snapshot is received subsequent to the first command. The snapshot is created, in response to the second command, by copying the set of data onto at least one target storage volume at an event time.
    Type: Application
    Filed: September 25, 2008
    Publication date: March 25, 2010
    Applicant: International Business Machines Corporation
    Inventors: Shachar Fienblit, Sheli Rahav
  • Publication number: 20100077398
    Abstract: An apparatus for optimizing a transaction comprising an initial sequence of computer operations, the apparatus includes a processing unit which identifies one or more idempotent operations comprised within the initial sequence, and which reorders the initial sequence to form a reordered sequence comprising a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations, the second sub-sequence comprising only the one or more idempotent operations.
    Type: Application
    Filed: November 29, 2009
    Publication date: March 25, 2010
    Applicant: International Business Machines Corporation
    Inventors: Eitan Farchi, Shachar Fienblit, Amiram Hayardeny, Rivka Matosevich, Ifat Nuriel, Sheli Rahav, Dalit Tzafrir
  • Patent number: 7664766
    Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.
    Type: Grant
    Filed: September 12, 2006
    Date of Patent: February 16, 2010
    Assignee: International Business Machines Corporation
    Inventors: Michael Factor, Shachar Fienblit, Guy Laden, Paula Ta-Shma
  • Patent number: 7661099
    Abstract: A method for optimizing a transaction consisting of an initial sequence of computer operations, the method including identifying one or more idempotent operations in the initial sequence. The method further includes reordering the initial sequence to form a reordered sequence consisting of a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations. The second sub-sequence has only the one or more idempotent operations.
    Type: Grant
    Filed: June 29, 2004
    Date of Patent: February 9, 2010
    Assignee: International Business Machines Corporation
    Inventors: Eitan Farchi, Shachar Fienblit, Amiram Hayardeny, Rivka Matosevich, Ifat Nuriel, Sheli Rahav, Dalit Tzafrir
  • Publication number: 20100030992
    Abstract: A method for initializing a memory area, the method includes: receiving a request to access a first memory sub of a first memory area that comprises multiple memory sub areas; and initializing the first memory sub area if a first memory area initialization indicator differs from a first memory sub area initialization request indicator; wherein the first memory area initialization request indicator is a multiple bit variable indicative of a time of a last request to initialize the first memory area and the first memory sub area initialization indicator is a multiple bit variation indicative of a time of a request to initialize the first memory area that resulted in a last initialization of the first memory sub area.
    Type: Application
    Filed: July 29, 2008
    Publication date: February 4, 2010
    Applicant: International Business Machines Corporation
    Inventors: Shachar Fienblit, Eyal Gordon, Avaid Zlotnick
  • Patent number: 7650476
    Abstract: A method for generating a consistent point in time copy of data, the method includes: selecting at least one selected data block to be copied from a source volume to a target volume in response to a request to generate a consistent point in time copy of multiple data blocks; waiting until the source volume is ready to send the at least one selected data block to a remote volume while queuing at least one data block modify request; de-queuing the at least one queued modify requests while copying the at least one selected data block from the source volume to the target volume; wherein the copying includes utilizing a first copying mechanism to copy a first selected data block if a request to modify the first selected block is de-queued before the first selected data block is copied to the target volume; else, the copying includes using a second copying mechanism that is slower than the first copying mechanism.
    Type: Grant
    Filed: October 18, 2006
    Date of Patent: January 19, 2010
    Assignee: International Business Machines Corporation
    Inventors: Gal Ashour, Kenneth Wayne Boyd, Michael Factor, Shachar Fienblit, Olympia Gluck, Amiram Hayardeny, Eli Malul, Ifat Nuriel, Noa Privman-Horesh, Dalit Tzafrir, Sam Clark Werner
  • Publication number: 20090327601
    Abstract: A data storage system is provided.
    Type: Application
    Filed: June 30, 2008
    Publication date: December 31, 2009
    Inventors: Shachar Fienblit, Martin Tross, Aviad Zlotnick
  • Publication number: 20090327627
    Abstract: A storage system and a method for copying data is provided. The method includes storing data at a first storage unit of a primary site, transferring the data from the first storage unit to a second storage unit of a remote site and updating shadow storage unit metadata to reflect the storing of the data at the first storage unit, and copying, in response to the updating of the shadow storage unit metadata, the data from an entity that differs from the shadow storage unit to a third storage unit.
    Type: Application
    Filed: June 27, 2008
    Publication date: December 31, 2009
    Applicant: International Business Machines Corporation
    Inventors: Akram Bitar, Shachar Fienblit
  • Patent number: 7627729
    Abstract: An apparatus, system, and method are disclosed for activating a synchronous mirror as a primary storage volume. The apparatus system and method include directing a third storage volume to store updates sent to the third storage volume from a second storage volume onto a first storage volume in response to the first storage volume becoming operational after a failure, terminating sending updates from the second storage volume to the third storage volume in response to the first storage volume becoming substantially consistent with the third storage volume, and synchronously storing updates received by the second storage volume on the first storage volume and asynchronously storing updates received by the first storage volume on the third storage volume in response to terminating sending updates from the second storage volume to the third storage volume after the first and third storage volumes are substantially consistent.
    Type: Grant
    Filed: September 7, 2006
    Date of Patent: December 1, 2009
    Assignee: International Business Machines Corporation
    Inventors: Robert Francis Bartfai, Nicolas Marc Clayton, Shachar Fienblit, Olympia Gluck, Eli Malul, Gail Andrea Spear
  • Patent number: 7617484
    Abstract: A computer program product including computer usable media having computer usable program code for ranking coverage over subsets of code by combining coverage measure with concern based criteria for each code subsets, ordering the code subsets by the combination of coverage measure and concern based criteria, and outputting to a user the ordered code subsets.
    Type: Grant
    Filed: August 5, 2008
    Date of Patent: November 10, 2009
    Assignee: International Business Machines Corporation
    Inventors: Shachar Fienblit, Eitan Farchi, Moran Shochat
  • Publication number: 20090249298
    Abstract: A method for software processing includes obtaining change information, which records changes that have been performed in respective locations in software code. The change information is processed so as to assign to at least some of the locations respective priorities, which are indicative of respective likelihoods that the locations contain program faults. The at least some of the locations are presented to a user in accordance with the assigned priorities.
    Type: Application
    Filed: March 31, 2008
    Publication date: October 1, 2009
    Inventors: Lawrence C. Blount, Eitan Daniel Farchi, Shachar Fienblit, Sergey Novikov, Orna Raz-Pelleg
  • Publication number: 20090249116
    Abstract: Provided are a method, system, and article of manufacture for managing writes received to data units that are being transferred to a secondary storage as part of a mirror relationship. Synchronization information indicates data units to transfer from a primary storage to a secondary storage, wherein the synchronization information data is updated to indicate the transfer of one of the data units from the primary storage to the secondary storage. A storage controller receives a write request having an update to a target data unit comprising one of the data units indicated in the synchronization information that has not been transferred from the primary storage to the secondary storage. The write request is allowed to apply the update to the target data unit in response to transferring the data in the target data unit to a network adapter of the storage controller and before the data in the target data unit is transferred to the secondary storage.
    Type: Application
    Filed: March 31, 2008
    Publication date: October 1, 2009
    Applicant: International Business Machines Corporation
    Inventors: Robert Francis BARTFAI, Michael E. FACTOR, Shachar FIENBLIT, Olympia GLUCK, Eyal GORDON, Thomas Charles JARVIS, Eli MALUL, Carol Santich MELLGREN, Gail Andrea SPEAR, Aviad ZLOTNICK
  • Publication number: 20090216954
    Abstract: An apparatus, system, and method are disclosed for selecting a space efficient repository. A cache receives write data. A destage module destages the data sequentially to a coarse grained repository such as a stride level repository and destages a directory entry for the data to a coarse grained directory such as a stride level directory if the data satisfies a repository policy. In addition, the destage module destages the data to a fine grained repository such as a track level repository overwriting an existing data instance and destages the directory entry to a fine grained directory such as a track level directory if the data does not satisfy the repository policy.
    Type: Application
    Filed: February 27, 2008
    Publication date: August 27, 2009
    Inventors: Michael Thomas Benhase, Shachar Fienblit, Yu-Cheng Hsu, Matthew Joseph Kalos
  • Patent number: 7581063
    Abstract: Disclosed is a method, system, and program for managing metadata in cache. A first policy is used to determine when to remove data from a primary cache, and a second policy is used to determine when to remove data from a metadata cache.
    Type: Grant
    Filed: June 3, 2005
    Date of Patent: August 25, 2009
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, Shachar Fienblit, Olympia Gluck, Joseph Smith Hyde, II, Thomas Charles Jarvis, William Frank Micka, Gail Andrea Spear, Martin Jacob Tross, Aviad Zlotnick
  • Publication number: 20090210643
    Abstract: Generating a consistent point in time copy of data in a source volume and a target volume is achieved responsively to a first data modification request by writing a first altered version of the data onto a single source volume, asynchronously transferring the first altered version from the first storage site to a target volume located at a remote second storage site, while avoiding copying the first altered version onto other volumes at the first storage site. While asynchronously transferring the first altered version de-queuing a second modification request, and responsively to the second modification request synchronously transferring the first altered version from the first storage site to the target volume. Then a second altered version of the data is written to the single source volume and a copy transferred to the target volume in like manner.
    Type: Application
    Filed: April 27, 2009
    Publication date: August 20, 2009
    Applicant: International Business Machines Corporation
    Inventors: Gal Ashour, Kenneth Wayne Boyd, Michael Factor, Shachar Fienblit, Olympia Gluck, Amiram Hayardeny, Eli Malul, Ifat Nuriel, Noa Privman-Horesh, Dalit Tzafrir, Sam Clark Werner
  • Publication number: 20090204946
    Abstract: A method for modifying executable logic code stored on a computing system is provided. The method comprises assessing a risk level associated with modifying a first code block and assessing an urgency level associated with modifying the first code block and then evaluating whether the first code block should be modified.
    Type: Application
    Filed: February 12, 2008
    Publication date: August 13, 2009
    Applicant: International Business Machines Corporation
    Inventors: Shachar Fienblit, Itzhack Goldberg, Aviad Zlotnick
  • Publication number: 20090187613
    Abstract: Techniques are provided for performing a copy operation. A fast reverse restore command indicating a new source and a new target is received, wherein the new source is an original target and the new target is an original source. A synchronous scan is performed on the new target. A new target structure associated with the new target is updated using a new source structure associated with the new source. Techniques are also provided for performing a copy operation in which a fast reverse restore command is received after an instant virtual copy has been performed from a new target to a new source and wherein the fast reverse restore command is performed before a background copy has been performed by the instant virtual copy.
    Type: Application
    Filed: October 21, 2008
    Publication date: July 23, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gail Andrea Spear, Michael E. Factor, Rivka Mayraz Matosevich, Shachar Fienblit, Sheli Rahav, Robert Francis Bartfai, Dalit Tzafrir, Ifat Nuriel
  • Publication number: 20090150627
    Abstract: Provided are a method, system, and article of manufacture for determining whether to use a repository to store data updated during a resynchronization. Writes to a primary storage are transferred to a secondary storage. A logical copy of the secondary storage as of a point-in-time is established. Writes to the secondary storage in the logical copy received from the primary storage during a logical copy duration after the point-in-time are stored in a repository that comprises less storage space than the secondary storage in the logical copy. The transferring of writes to the secondary storage is suspended. During the suspension writes to the primary storage are indicated in an out-of-synch data structure.
    Type: Application
    Filed: December 6, 2007
    Publication date: June 11, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael Thomas Benhase, Shachar Fienblit, Matthew Joseph Kalos, Gail Andrea Spear, Sonny Earl Williams
  • Publication number: 20090150626
    Abstract: Provided are a method, system, and article of manufacture for determining whether to use a full volume or repository for a logical copy backup space. A determination is made of a source volume to backup using a logical copy operation. The logical copy operation is completed upon indicating the source volume data to backup. During a logical copy duration, point-in-time data in the source volume as of a point-in-time when the logical copy was established is copied to a backup space in response to receiving an update to the point-in-time data. A history of writes to the source volume is processed to determine whether to allocate a full target volume as the backup space providing a corresponding data unit for each data unit in the source volume or allocate a repository as the backup space, wherein the repository uses less storage space than the full target volume. The logical copy operation using the determined full target volume or repository as the backup space is initiated.
    Type: Application
    Filed: December 6, 2007
    Publication date: June 11, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael Thomas Benhase, Shachar Fienblit, Yu-Cheng Hsu, Matthew Joseph Kalos