Patents by Inventor Sivan Tal

Sivan Tal 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: 20070022267
    Abstract: Provided are a method, system, and article of manufacture for copying storage. Copy operations are performed on source storage units to copy to target storage units, wherein the copy operations create a consistent copy of the source storage units in the target storage units. While performing a copy operation to copy from one source storage unit to one target storage unit, a write operation is restricted from being performed on the one source storage unit, until the copy operations have been performed on the source storage units.
    Type: Application
    Filed: September 21, 2006
    Publication date: January 25, 2007
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sam Werner, William Micka, Sivan Tal, Ifat Nuriel, Sheli Rahav, Gail Spear, Warren Stanley
  • Patent number: 7133982
    Abstract: Provided are a method, system, and article of manufacture for copying storage. Copy operations are performed on source storage units to copy to target storage units, wherein the copy operations create a consistent copy of the source storage units in the target storage units. While performing a copy operation to copy from one source storage unit to one target storage unit, a write operation is restricted from being performed on the one source storage unit, until the copy operations have been performed on the source storage units.
    Type: Grant
    Filed: June 18, 2003
    Date of Patent: November 7, 2006
    Assignee: International Business Machines Corporation
    Inventors: Sam Clark Werner, William Frank Micka, Sivan Tal, Ifat Nuriel, Sheli Rahav, Gail Andrea Spear, Warren K. Stanley
  • Patent number: 7107396
    Abstract: A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic “create a new page” procedure. Means for performing an atomic write “add block” procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a “delete page” procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.
    Type: Grant
    Filed: October 31, 2003
    Date of Patent: September 12, 2006
    Assignee: International Business Machines Corporation
    Inventors: Michael Factor, Rivka Matosevich, Sivan Tal
  • Patent number: 7047378
    Abstract: Provided are a method, system, and program for managing a relationship between one target volume and one source volume. Information is maintained in memory on an existing relationship between at least one source volume and at least one target volume, comprising: (i) at least one element, wherein each element represents a range of sequential data units in the volume; (ii) at least one relationship entry, wherein each relationship entry represents one relationship; and (iii) at least one element pointer associating one element with one relationship entry, wherein the data units represented by the element are part of the relationship represented by the relationship entry that the pointer associates with the element. A new relationship between at least one target volume and at least one source volume is added.
    Type: Grant
    Filed: June 17, 2003
    Date of Patent: May 16, 2006
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, Amiram Hayardeny, Thomas Charles Jarvis, Gail Andrea Spear, William Frank Micka, Sivan Tal, Dalit Tzafrir, Rivka Mayraz Matosevich, Sheli Rahav, Ifat Nuriel, Shachar Fienblit, Svetlana Shukevich
  • Patent number: 7047390
    Abstract: Provided are a method, system, and program for managing a relationship between one target volume and one source volume. For each of the source volume and target volume, the memory includes: (i) at least one element, wherein each element represents a range of sequential data units in the volume; (ii) at least one relationship entry, wherein each relationship entry represents one relationship; (iii) at least one element pointer associating one element with one relationship entry, wherein the data units represented by the element are part of the relationship represented by the relationship entry that the pointer associates with the element; and (iv) one relationship pointer for each relationship entry associating the relationship entry with volume metadata, wherein the volume metadata provides information on the relationship represented by the relationship entry.
    Type: Grant
    Filed: June 17, 2003
    Date of Patent: May 16, 2006
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Factor, Amiram Hayardeny, Thomas Charles Jarvis, Gail Andrea Spear, William Frank Micka, Sivan Tal, Dalit Tzafrir, Rivka Mayraz Matosevich, Sheli Rahav, Ifat Nuriel, Shachar Fienblit, Svetlana Shukevich
  • Patent number: 7000145
    Abstract: Disclosed is a technique for applying changes back to an original copy of data to reduce an amount of data transferred. A first indicator is maintained for each block of data in a first storage to indicate whether the block of data has been updated in the first storage since the block of data was last transferred to a second storage. A second indicator is maintained for each block of data in the second storage to indicate whether the block of data has been updated in the second storage since the block of data in the second storage was overwritten by a corresponding block of data in the first storage.
    Type: Grant
    Filed: June 18, 2003
    Date of Patent: February 14, 2006
    Assignee: International Business Machines Corporation
    Inventors: Sam Clark Werner, William Frank Micka, Dalit Tzafrir, Matthew Sanchez, Sivan Tal, Ifat Nuriel, Sheli Rahav, Gail Andrea Spear, Warren K. Stanley, Thomas Charles Jarvis, Amiram Hayardeny, Shachar Fienblit, Rivka Mayraz Matosevich, Svetlana Shukevich, Theresa Mary Brown
  • Patent number: 6996586
    Abstract: Disclosed is a technique for reducing an amount of data transferred. A first indicator is maintained for each source block of data to indicate whether the source block of data has been updated in source storage since the source block of data was last transferred to target storage. A second indicator is maintained for each target block of data in target storage to indicate whether the target block of data has been updated in target storage since the target block of data was overwritten by a corresponding source block of data. When transferring data from the source storage to the target storage, each source block of data for which a first indicator has been set to indicate that the source block of data has been updated is transferred and each source block of data that corresponds to a target block of data for which a second indicator has been set to indicate that the target block of data has been updated is transferred.
    Type: Grant
    Filed: June 18, 2003
    Date of Patent: February 7, 2006
    Assignee: International Business Machines Corporation
    Inventors: Warren K. Stanley, William Frank Micka, Sam Clark Werner, Sivan Tal, Gail Andrea Spear, Theresa Mary Brown, Matthew Sanchez, Sheli Rahav, Thomas Charles Jarvis, Amiram Hayardeny, Dalit Tzafrir, Shachar Fienblit, Rivka Mayraz Matosevich, Svetlana Shukevich, Ifat Nuriel
  • Publication number: 20050097266
    Abstract: A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic “create a new page” procedure. Means for performing an atomic write “add block” procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a “delete page” procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.
    Type: Application
    Filed: October 31, 2003
    Publication date: May 5, 2005
    Applicant: International Business Machines Corporation
    Inventors: Michael Factor, Rivka Matosevich, Sivan Tal
  • Publication number: 20050071372
    Abstract: A two-phase process FlashCopy operation is provided that can be used to aid in the formation of consistency groups across multiple storage control units. In the first phase, preparations to create a new consistency group are made “revertible” by write-inhibiting the source volumes through “Establish-FlashCopy-revertible” commands. If the preparation of any volume within the consistency group fails, a “Withdraw-FlashCopy-revert” command may be executed, thereby causing a retention of the prior FlashCopy point-in-time copy. In the second phase, executed if all preparations are successful, a “Withdraw-FlashCopy-commit” command may be executed to remove all write-inhibit indicators, complete the creation of the new FlashCopy point-in-time copy and secure the new consistency group. Write requests to the FlashCopy source volumes may then be received and processed without risking corruption of the new consistency group on the Flashcopy target volumes.
    Type: Application
    Filed: September 29, 2003
    Publication date: March 31, 2005
    Applicant: International Business Machines Corporation
    Inventors: Robert Bartfai, Edward Lin, Gail Spear, Michael Factor, Sivan Tal
  • Publication number: 20040260898
    Abstract: Disclosed is a technique for reducing an amount of data transferred. A first indicator is maintained for each source block of data to indicate whether the source block of data has been updated in source storage since the source block of data was last transferred to target storage. A second indicator is maintained for each target block of data in target storage to indicate whether the target block of data has been updated in target storage since the target block of data was overwritten by a corresponding source block of data. When transferring data from the source storage to the target storage, each source block of data for which a first indicator has been set to indicate that the source block of data has been updated is transferred and each source block of data that corresponds to a target block of data for which a second indicator has been set to indicate that the target block of data has been updated is transferred.
    Type: Application
    Filed: June 18, 2003
    Publication date: December 23, 2004
    Inventors: Warren K. Stanley, William Frank Micka, Sam Clark Werner, Sivan Tal, Gail Andrea Spear, Theresa Mary Brown, Matthew Sanchez, Sheli Rahav, Thomas Charles Jarvis, Amiram Hayardeny, Dalit Tzafrir, Shachar Fienblit, Rivka Mayraz Matosevich, Svetlana Shukevich, Ifat Nuriel
  • Publication number: 20040260895
    Abstract: Disclosed is a technique for applying changes back to an original copy of data to reduce an amount of data transferred. A first indicator is maintained for each block of data in a first storage to indicate whether the block of data has been updated in the first storage since the block of data was last transferred to a second storage. A second indicator is maintained for each block of data in the second storage to indicate whether the block of data has been updated in the second storage since the block of data in the second storage was overwritten by a corresponding block of data in the first storage.
    Type: Application
    Filed: June 18, 2003
    Publication date: December 23, 2004
    Inventors: Sam Clark Werner, William Frank Micka, Dalit Tzafrir, Matthew Sanchez, Sivan Tal, Ifat Nuriel, Sheli Rahav, Gail Andrea Spear, Warren K. Stanley, Thomas Charles Jarvis, Amiram Hayardeny, Shachar Fienblit, Rivka Mayraz Matosevich, Svetlana Shukevich, Theresa Mary Brown
  • Publication number: 20040260870
    Abstract: Provided are a method, system, and program for managing a relationship between one target volume and one source volume. Information is maintained in memory on an existing relationship between at least one source volume and at least one target volume, comprising: (i) at least one element, wherein each element represents a range of sequential data units in the volume; (ii) at least one relationship entry, wherein each relationship entry represents one relationship; and (iii) at least one element pointer associating one element with one relationship entry, wherein the data units represented by the element are part of the relationship represented by the relationship entry that the pointer associates with the element. A new relationship between at least one target volume and at least one source volume is added.
    Type: Application
    Filed: June 17, 2003
    Publication date: December 23, 2004
    Applicant: International Business Machines Corporation
    Inventors: Michael E. Factor, Amiram Hayardeny, Thomas Charles Jarvis, Gail Andrea Spear, William Frank Micka, Sivan Tal, Dallt Tzafrir, Rivka Mayraz Matosevich, Sheli Rahav, Ifat Nuriel, Shachar Fienblit, Svetlana Shukevich
  • Publication number: 20040260869
    Abstract: Provided are a method, system, and program for managing a relationship between one target volume and one source volume. For each of the source volume and target volume, the memory includes: (i) at least one element, wherein each element represents a range of sequential data units in the volume; (ii) at least one relationship entry, wherein each relationship entry represents one relationship; (iii) at least one element pointer associating one element with one relationship entry, wherein the data units represented by the element are part of the relationship represented by the relationship entry that the pointer associates with the element; and (iv) one relationship pointer for each relationship entry associating the relationship entry with volume metadata, wherein the volume metadata provides information on the relationship represented by the relationship entry.
    Type: Application
    Filed: June 17, 2003
    Publication date: December 23, 2004
    Applicant: International Business Machines Corporation
    Inventors: Michael E. Factor, Amiram Hayardeny, Thomas Charles Jarvis, Gail Andrea Spear, William Frank Micka, Sivan Tal, Dalit Tzafrir, Rivka Mayraz Matosevich, Sheli Rahav, Ifat Nuriel, Shachar Fienblit, Svetlana Shukevich
  • Publication number: 20040260896
    Abstract: Provided are a method, system, and article of manufacture for copying storage. Copy operations are performed on source storage units to copy to target storage units, wherein the copy operations create a consistent copy of the source storage units in the target storage units. While performing a copy operation to copy from one source storage unit to one target storage unit, a write operation is restricted from being performed on the one source storage unit, until the copy operations have been performed on the source storage units.
    Type: Application
    Filed: June 18, 2003
    Publication date: December 23, 2004
    Inventors: Sam Clark Werner, William Frank Micka, Sivan Tal, Ifat Nuriel, Sheli Rahav, Gail Andrea Spear, Warren K. Stanley