-
1.发明申请
公开(公告)号：WO2004111852A3
公开(公告)日：2006-01-05
申请号：PCT/EP2004051057
申请日：2004-06-08
Applicant: IBM , IBM UK , FACTOR MICHAEL , FIENBLIT SHACHAR , HAYARDENY AMIRAN , JARVIS THOMAS CHARLES , MATOSEVICH RIVKA MAYRAZ , MICKA WILLIAM FRANK , NURIEL IFAT , RAHAV SHELI , SHUKEVICH SVETLANA , SPEAR GAIL ANDREA , TAL SIVAN , TZAFRIR DALIT
Inventor： FACTOR MICHAEL , FIENBLIT SHACHAR , HAYARDENY AMIRAN , JARVIS THOMAS CHARLES , MATOSEVICH RIVKA MAYRAZ , MICKA WILLIAM FRANK , NURIEL IFAT , RAHAV SHELI , SHUKEVICH SVETLANA , SPEAR GAIL ANDREA , TAL SIVAN , TZAFRIR DALIT
CPC classification number: G06F3/065 , G06F3/0614 , G06F3/064 , G06F3/0683 , G06F11/1435 , Y10S707/99953 , Y10S707/99954
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.
Abstract translation: 提供了一种用于管理一个目标卷和一个源卷之间的关系的方法，系统和程序。 对于源卷和目标卷中的每一个，存储器包括：（i）至少一个元素，其中每个元素表示卷中的顺序数据单元的范围; （ii）至少一个关系条目，其中每个关系条目表示一个关系; （iii）将一个元素与一个关系条目相关联的至少一个元素指针，其中由该元素表示的数据单元是由指针与元素相关联的关系条目表示的关系的一部分; 以及（iv）将关系条目与卷元数据相关联的每个关系条目的一个关系指针，其中所述卷元数据提供关于由关系条目表示的关系的信息。
-
2.发明专利
公开(公告)号：JP2005352821A
公开(公告)日：2005-12-22
申请号：JP2004173661
申请日：2004-06-11
Applicant: Internatl Business Mach Corp
, インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation Inventor： FACTOR MICHAEL E , HAYARDENY AMIRAM , JARVIS THOMAS CHARLES , SPEAR GAIL A , WILLIAM FRANK MIKKA , TAL SIVAN , TZAFRIR DALIT , MATOSEVICH RIVKA MAYRAZ , RAHAV SHELI , NURIEL IFAT , FIENBLIT SHACHAR , SHUKEVICH SVETLANA
Abstract: PROBLEM TO BE SOLVED: To provide a method, a system and a program for managing the relationship between one target volume and one source volume.
SOLUTION: By at least one element representing a range of a sequential data unit in a volume, at least one relation item representing one relation, and at least one element pointer associating one element with one relation item, information related to an existing relationship between at least one source volume and one target volume is maintained in a memory. Further, when a new relationship between at least one target volume and at least one source volume is added, a new relation item representing the new relationship is added in the memory. Also, one new element pointer for each element is added so as to associate the new relation item with each element including a data unit included in the new relationship.
COPYRIGHT: (C)2006,JPO&NCIPIAbstract translation: 要解决的问题：提供一种用于管理一个目标卷和一个源卷之间的关系的方法，系统和程序。 解决方案：通过至少一个表示卷中的顺序数据单元的范围的元素，表示一个关系的至少一个关系项，以及将一个元素与一个关系项相关联的至少一个元素指针，与现有的相关联的信息 至少一个源卷和一个目标卷之间的关系保持在存储器中。 此外，当添加至少一个目标卷与至少一个源卷之间的新关系时，在存储器中添加表示新关系的新关系项。 另外，添加每个元素的一个新元素指针，以便将新的关系项与每个元素相关联，包括新关系中包括的数据单元。 版权所有（C）2006，JPO＆NCIPI
-
公开(公告)号：DE112012000604T5
公开(公告)日：2014-01-16
申请号：DE112012000604
申请日：2012-03-02
Applicant: IBM
Inventor： MATOSEVICH RIVKA MAYRAZ , BROWN THERESA MARY , GUPTA LOKESH , BENHASE MICHAEL THOMAS , MELLGREN CAROL S
IPC: G06F12/00
Abstract: Es wird ein Verfahren zum Löschen einer Relation zwischen einer Quelle und einem Ziel in einer Architektur mit mehreren Zielen beschrieben. Die Architektur mit mehreren Zielen beinhaltet eine Quelle und mehrere platzsparende (SE-)Ziele, die dieser zugeordnet sind. Bei einer Ausführungsform beinhaltet ein solches Verfahren zunächst ein Identifizieren einer Relation, die aus der Architektur mit mehreren Zielen gelöscht werden soll. Anschließend wird ein platzsparendes (SE-)Ziel identifiziert, das der Relation zugehörig ist. Eine Zuordnungsstruktur ordnet Daten in logischen Spuren des SE-Ziels physischen Spuren einer Datenablage zu. Anschließend identifiziert das Verfahren ein gleichgeordnetes SE-Ziel, das Daten von dem SE-Ziel erbt. Nachdem das SE-Ziel und das gleichgeordnete SE-Ziel identifiziert worden sind, modifiziert das Verfahren die Zuordnungsstruktur, um die Daten in den physischen Spuren der Datenablage den logischen Spuren des gleichgeordneten SE-Ziels zuzuordnen. Die Relation wird anschließend zwischen der Quelle und dem SE-Ziel gelöscht. Ein entsprechendes Computerprogrammprodukt wird hierin ebenfalls beschrieben.
-
Patent Agency Ranking
公开(公告)号：AT338303T
公开(公告)日：2006-09-15
申请号：AT04766037
申请日：2004-06-11
Applicant: IBM
Inventor： STANLEY WARREN , MICKA WILLIAM FRANK , WERNER SAM CLARK , TAL SIVEN , SPEAR GAIL ANDREA , BROWN THERESA MARY , SANCHEZ MATTHEW , RAHAV SHELI , JARVIS THOMAS CHARLES , HAYARDENY AMIRAM , TZAFRIR DALIT , FIENBLIT SHACHAR , MATOSEVICH RIVKA MAYRAZ , SHUKEVICH SVETLANA , NURIEL IFAT
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.
-
公开(公告)号：DE602004007925T2
公开(公告)日：2008-04-24
申请号：DE602004007925
申请日：2004-06-08
Applicant: IBM
Inventor： FACTOR MICHAEL , FIENBLIT SHACHAR , HAYARDENY AMIRAN , JARVIS THOMAS CHARLES , MATOSEVICH RIVKA MAYRAZ , MICKA WILLIAM FRANK , NURIEL IFAT , RAHAV SHELI , SHUKEVICH SVETLANA , SPEAR GAIL ANDREA , TAL SIVAN , TZAFRIR DALIT
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.
-
公开(公告)号：DE602004007925D1
公开(公告)日：2007-09-13
申请号：DE602004007925
申请日：2004-06-08
Applicant: IBM
Inventor： FACTOR MICHAEL , FIENBLIT SHACHAR , HAYARDENY AMIRAN , JARVIS THOMAS CHARLES , MATOSEVICH RIVKA MAYRAZ , MICKA WILLIAM FRANK , NURIEL IFAT , RAHAV SHELI , SHUKEVICH SVETLANA , SPEAR GAIL ANDREA , TAL SIVAN , TZAFRIR DALIT
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.
-
7.发明专利
公开(公告)号：GB2502929A
公开(公告)日：2013-12-11
申请号：GB201316907
申请日：2012-03-02
Applicant: IBM
Inventor： MATOSEVICH RIVKA MAYRAZ , MELLGREN CAROL SANTICH , BROWN THERESA MARY , GUPTA LOKESH , BENHASE MICHAEL THOMAS
IPC: G06F12/00
Abstract: A method for deleting a relation between a source and a target in a multi-target architecture is described. The multi-target architecture includes a source and multiple space-efficient (SE) targets mapped thereto. In one embodiment, such a method includes initially identifying a relation for deletion from the multi-target architecture. A space-efficient (SE) target associated with the relation is then identified. A mapping structure maps data in logical tracks of the SE target to physical tracks of a repository. The method then identifies a sibling SE target that inherits data from the SE target. Once the SE target and the sibling SE target are identified, the method modifies the mapping structure to map the data in the physical tracks of the repository to the logical tracks of the sibling SE target. The relation is then deleted between the source and the SE target. A corresponding computer program product is also described herein.
-
公开(公告)号：SG135961A1
公开(公告)日：2007-10-29
申请号：SG2004032850
申请日：2004-06-01
Applicant: IBM
Inventor： FACTOR MICHAEL E , HAYARDENY AMIRAM , JARVIS THOMAS CHARLES , SPEAR GAIL ANDREA , MICKA WILLIAM FRANK , TAL SIVAN , TZAFRIR DALIT , MATOSEVICH RIVKA MAYRAZ , RAHAV SHELI , NURIEL IFAT , FIENBLIT SHACHAR , SHUKEVICH SVETLANA
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. Further, added is a new relationship entry in the memory representing the new relationship and one new element pointer is added in the memory for each element including data units included in the new relationship to associate the element with the new relationship entry, wherein the data units represented by the element are part of the new relationship.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.02 seconds)
