专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明申请

US20090063668A1 TRANSFER OF OWNERSHIP OF A STORAGE OBJECT IN RESPONSE TO AN ORIGINAL OWNER NODE BECOMING AVAILABLE AFTER A PERIOD OF UNAVAILABILITY 失效
标题翻译：转让存储对象的所有权对原始所有者代码的响应在可用性期限之后可用
公开(公告)号：US20090063668A1
公开(公告)日：2009-03-05
申请号：US11847255
申请日：2007-08-29
申请人： Thomas William Bish , Jonathan Wayne Peake , Mark Albert Reid , Joseph M. Swingler
发明人： Thomas William Bish , Jonathan Wayne Peake , Mark Albert Reid , Joseph M. Swingler
IPC分类号： G06F15/173
CPC分类号： H04L67/1097 , G06F3/0617 , G06F3/0631 , G06F3/067 , G06F11/1662 , G06F11/2033 , G06F11/2035 , G06F11/2046 , H04L69/40
摘要： Provided are a method, system, and article of manufacture, wherein a plurality of nodes coupled over a network are maintained, wherein a first node of the plurality of nodes initially owns a plurality of storage objects accessible via the network. A second node preemptively takes ownership of a selected storage object of the plurality of storage objects, in response to the first node becoming unavailable, wherein other nodes of the plurality of nodes can request ownership of the selected storage object while the first node is unavailable. A determination is made that the first node that originally owned the selected storage object has become available after a period of unavailability. A determination is made of the current owner node of the selected storage object, wherein the current owner node is one of the second node and the other nodes. The selected storage object is updated at the first node by the current owner node of the selected storage object, prior to allowing the first node to act on or assume ownership of the selected storage object.
摘要翻译：提供了一种方法，系统和制品，其中维持通过网络耦合的多个节点，其中多个节点中的第一节点最初拥有经由网络可访问的多个存储对象。响应于第一节点变得不可用，第二节点抢占地获取所述多个存储对象的所选存储对象的所有权，其中所述多个节点中的其他节点可以在所述第一节点不可用时请求所选择的存储对象的所有权。确定原始拥有所选存储对象的第一个节点在不可用时间段之后变得可用。确定所选存储对象的当前所有者节点，其中当前所有者节点是第二节点和其他节点之一。所选择的存储对象在允许第一节点对所选择的存储对象起作用或具有所选择的存储对象之前，由所选存储对象的当前所有者节点在第一节点处更新。

12. 发明授权

US06463513B1 Cache storage optimization in a data storage library of a redundant copy synchronization token tracking system 失效
标题翻译：冗余复制同步令牌跟踪系统的数据存储库中的缓存存储优化
公开(公告)号：US06463513B1
公开(公告)日：2002-10-08
申请号：US09391188
申请日：1999-09-07
申请人： Thomas William Bish , Gregory Tad Kishi
发明人： Thomas William Bish , Gregory Tad Kishi
IPC分类号： G06F1206
CPC分类号： G06F12/0866 , G06F11/2056 , G06F11/2058 , G06F2212/312 , Y10S707/99952 , Y10S707/99953
摘要： The availability of cache storage is increased for data storage libraries which store redundant copies of identifiable data volumes, by migrating all but one of the redundant copies of the data volume to backing storage on a high priority basis. Each of the identifiable data volumes is directly associated with an updatable synchronization token, which is maintained by the data storage libraries. The synchronization token indicates the relative update levels of the directly associated redundant copies. For redundant data volumes having identically updated synchronization tokens, upon selection of the data storage library as primary, the library places the data volume in the cache storage at a low priority of a predetermined sequence, so that the data volume is maintained in cache storage and is migrated only on a low priority basis. Upon selection of the data storage library as secondary, the library places the data volume in the cache storage at a high priority of the predetermined sequence for migrating the data volume to the backing store on the high priority basis, the migration freeing and making available a portion of the cache storage.
摘要翻译：通过将数据卷中的所有冗余副本迁移到高优先级的后备存储，可以增加存储可识别数据卷冗余副本的数据存储库。每个可识别的数据卷与可更新的同步令牌直接相关联，可更新的同步令牌由数据存储库维护。同步令牌表示直接相关的冗余副本的相对更新级别。对于具有相同更新的同步令牌的冗余数据卷，在将数据存储库选择为主要时，库将数据卷以预定顺序的低优先级放置在高速缓存存储器中，使得数据卷保持在高速缓存存储器中，并且仅在低优先级的基础上进行迁移。在将数据存储库选择为次要时，库将高速缓存存储器中的数据量以预定顺序的高优先级进行放置，以便在高优先级的基础上将数据卷迁移到后备存储器，迁移释放并使其可用部分缓存存储。

13. 发明授权

US08538932B2 Extended logical worm data integrity protection with unique worm identifier in header and database 失效
标题翻译：扩展的逻辑蠕虫数据完整性保护与标题和数据库中唯一的蠕虫标识符
公开(公告)号：US08538932B2
公开(公告)日：2013-09-17
申请号：US13552456
申请日：2012-07-18
申请人： Thomas William Bish , Jonathan Wayner Peake , Mark Albert Reid , Joseph M Swingler
发明人： Thomas William Bish , Jonathan Wayner Peake , Mark Albert Reid , Joseph M Swingler
IPC分类号： G06F17/00
CPC分类号： G11B5/00813 , G06F2221/2129 , G11B15/04 , G11B27/3027 , G11B2220/218 , G11B2220/2516 , G11B2220/415 , G11B2220/417 , G11B2220/90 , H04L63/12
摘要： A data storage system stores logical data object(s), each identified by a logical identifier. A control is configured to assign a unique WORM (Write Once Read Many) identifier to the logical data object, and stores the unique WORM identifier as associated with the logical identifier, in a database maintained by the control so as to be persistent. Data storage is configured to write the logical data object with a header with the unique WORM identifier. The control, in order to allow the logical data object to be accessed externally to the control, requires matching the unique WORM identifier in the header of a logical data object to the unique WORM identifier of the persistent database for the logical object. The unique WORM identifier is formed of a checksum hash value related to nonce fields comprising at least the logical identifier of the logical data object, and an incrementing token.
摘要翻译：数据存储系统存储逻辑数据对象，每个逻辑数据对象由逻辑标识符标识。控制被配置为向逻辑数据对象分配唯一的WORM（一次读取多个）标识符，并且将与逻辑标识符相关联的唯一WORM标识符存储在由控制器维护的数据库中以便被持久化。数据存储被配置为使用具有唯一WORM标识符的报头来写入逻辑数据对象。为了允许将逻辑数据对象从控制外部访问，控制需要将逻辑数据对象的头部中的唯一WORM标识符与逻辑对象的持久性数据库的唯一WORM标识匹配。独特的WORM标识符由与至少包括逻辑数据对象的逻辑标识符和增量令牌的至少包含字段相关的校验和散列值形成。

14. 发明申请

US20120290805A1 CLUSTER FAMILIES FOR CLUSTER SELECTION AND COOPERATIVE REPLICATION 有权
标题翻译：集群选择和合作复制的集群系列
公开(公告)号：US20120290805A1
公开(公告)日：2012-11-15
申请号：US13555367
申请日：2012-07-23
申请人： Thomas William BISH , Takeshi NOHTA , Joseph M. SWINGLER , Rufus-John Yeisuke TWITO
发明人： Thomas William BISH , Takeshi NOHTA , Joseph M. SWINGLER , Rufus-John Yeisuke TWITO
IPC分类号： G06F12/16
CPC分类号： G06F3/0619 , G06F3/0604 , G06F3/0617 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F3/0683 , G06F3/0686 , G06F11/1464 , G06F11/2082 , G06F12/0802 , G06F12/0815 , G06F12/0866 , G06F2212/1016 , H04L67/1095 , H04L67/1097
摘要： An apparatus, system, and method are disclosed for cooperative replication of multiple clusters. A copy request to copy a volume into a first cluster is received. A determination is made whether the first cluster is a family member of a cluster family. If the first cluster is a family member of the cluster family, a determination is made whether another family member already completed copying the volume. If another family member has not already copied the volume, the first cluster is designated to inherit the copy request. The copy request is executed and the volume is cooperative replicated into the cluster family. Cumulative consistency is achieved within the cluster family. The volume is shared within the cluster family so that all copies of the volume within the cluster family are consistent.
摘要翻译：公开了用于多个集群的协同复制的装置，系统和方法。接收将卷复制到第一个集群的复制请求。确定第一个集群是否是集群系列的家庭成员。如果第一个群集是群集系列的家庭成员，则确定另一个家庭成员是否已经完成复制卷。如果另一个家庭成员尚未复制卷，则指定第一个群集继承复制请求。执行复制请求，并将卷协作复制到群集系列中。在集群系列内实现累积一致性。卷在集群系列中共享，以便集群系列内的卷的所有副本一致。

15. 发明授权

US08280855B2 Extended logical worm data integrity protection with unique worm identifier in header and database 有权
标题翻译：扩展的逻辑蠕虫数据完整性保护与标题和数据库中唯一的蠕虫标识符
公开(公告)号：US08280855B2
公开(公告)日：2012-10-02
申请号：US12612435
申请日：2009-11-04
申请人： Thomas William Bish , Jonathan Wayne Peake , Mark Albert Reid , Joseph M Swingler
发明人： Thomas William Bish , Jonathan Wayne Peake , Mark Albert Reid , Joseph M Swingler
IPC分类号： G06F17/00
CPC分类号： G11B5/00813 , G06F2221/2129 , G11B15/04 , G11B27/3027 , G11B2220/218 , G11B2220/2516 , G11B2220/415 , G11B2220/417 , G11B2220/90 , H04L63/12
摘要： A data storage system stores logical data object(s), each identified by a logical identifier. A control is configured to assign a unique WORM (Write Once Read Many) identifier to the logical data object, and stores the unique WORM identifier as associated with the logical identifier, in a database maintained by the control so as to be persistent. Data storage is configured to write the logical data object with a header with the unique WORM identifier. The control, in order to allow the logical data object to be accessed externally to the control, requires matching the unique WORM identifier in the header of a logical data object to the unique WORM identifier of the persistent database for the logical object. The unique WORM identifier is formed of a checksum hash value related to nonce fields comprising at least the logical identifier of the logical data object, an incrementing token, and a time stamp.
摘要翻译：数据存储系统存储逻辑数据对象，每个逻辑数据对象由逻辑标识符标识。控制被配置为向逻辑数据对象分配唯一的WORM（一次读取多个）标识符，并且将与逻辑标识符相关联的唯一WORM标识符存储在由控制器维护的数据库中以便被持久化。数据存储被配置为使用具有唯一WORM标识符的报头来写入逻辑数据对象。为了允许将逻辑数据对象从控制外部访问，控制需要将逻辑数据对象的头部中的唯一WORM标识符与逻辑对象的持久性数据库的唯一WORM标识匹配。独特的WORM标识符由与至少包括逻辑数据对象的逻辑标识符，递增令牌和时间戳的至少包括的nonce字段相关的校验和散列值形成。

16. 发明授权

US08239570B2 Using link send and receive information to select one of multiple links to use to transfer data for send and receive operations 失效
标题翻译：使用链接发送和接收信息来选择多个链接之一用于传送数据以进行发送和接收操作
公开(公告)号：US08239570B2
公开(公告)日：2012-08-07
申请号：US12243957
申请日：2008-10-01
申请人： Ralph Thomas Beeston , Thomas William Bish , Joseph Whitney Dain , Jonathan Wayne Peake
发明人： Ralph Thomas Beeston , Thomas William Bish , Joseph Whitney Dain , Jonathan Wayne Peake
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： H04L45/00 , H04L45/125 , H04L45/24 , H04L45/38
摘要： Link information for a plurality of links to at least one target node indicates for each link a send throughput for sending data, a receive throughput for received data, a slate of the link indicating whether the link is online, offline or degraded. The send throughput of the links having the online state is processed to select one of the links to the receiving node m response to determining that more than one of the links has the online state. The data of the send operation is sent using the selected link to the receiving node. The receive throughput is processed to select one of the links having the online state to the sending node in response to determining that more than one of the links has the online state. The data of the receive operation is received using the selected link to the sending node.
摘要翻译：针对至少一个目标节点的多个链路的链接信息针对每个链路指示用于发送数据的发送吞吐量，用于接收到的数据的接收吞吐量，指示该链路是否在线，离线或退化的链接。处理具有在线状态的链路的发送吞吐量，以选择到接收节点m的响应之一以确定多于一个链路具有在线状态。使用所选择的链接将发送操作的数据发送到接收节点。处理接收吞吐量以响应于确定多于一个链路具有在线状态来选择具有在线状态的一个链路到发送节点。使用所选择的链接到发送节点接收接收操作的数据。

17. 发明授权

US08812799B2 Cluster families for cluster selection and cooperative replication 有权
标题翻译：用于集群选择和协作复制的集群系列
公开(公告)号：US08812799B2
公开(公告)日：2014-08-19
申请号：US12635702
申请日：2009-12-11
申请人： Thomas William Bish , Takeshi Nohta , Joseph M. Swingler , Rufus-John Yeisuke Twito
发明人： Thomas William Bish , Takeshi Nohta , Joseph M. Swingler , Rufus-John Yeisuke Twito
IPC分类号： G06F12/16 , G06F3/06 , G06F12/08
CPC分类号： G06F3/0619 , G06F3/0604 , G06F3/0617 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F3/0683 , G06F3/0686 , G06F11/1464 , G06F11/2082 , G06F12/0802 , G06F12/0815 , G06F12/0866 , G06F2212/1016 , H04L67/1095 , H04L67/1097
摘要： An apparatus, system, and method are disclosed to create cluster families for cluster selection and cooperative replication. The clusters are grouped into family members of a cluster family base on their relationships and roles. Members of the cluster family determine which family member is in the best position to obtain replicated information and become cumulatively consistent within their cluster family. Once the cluster family becomes cumulatively consistent, the data is shared within the cluster family so that all copies within the cluster family are consistent.
摘要翻译：公开了一种设备，系统和方法来创建用于集群选择和协作复制的集群系列。集群根据其关系和角色归为群集系列的家族成员。集群系列的成员确定哪个家庭成员处于最佳位置以获得复制的信息，并在其集群系列中变得累积一致。一旦集群系列变得累积一致，则数据在集群系列内共享，以便集群系列内的所有副本都是一致的。

18. 发明授权

US08565067B2 Apparatus, system, and method for link maintenance 失效
标题翻译：用于链路维护的装置，系统和方法
公开(公告)号：US08565067B2
公开(公告)日：2013-10-22
申请号：US12351661
申请日：2009-01-09
申请人： Ralph Thomas Beeston , Thomas William Bish , Joseph Whitney Dain
发明人： Ralph Thomas Beeston , Thomas William Bish , Joseph Whitney Dain
IPC分类号： G06F11/07
CPC分类号： G06F11/0793 , G06F11/0709 , H04L43/0811
摘要： An apparatus, system, and method are disclosed for link maintenance. A plurality of state machines operate a plurality of first links between data management nodes with each first link in an online state. A transition module transitions the plurality of first links from the online state to a degraded state and from the online state to an offline pending state in response to an offline request. The transition module further transitions the plurality of first links from the degraded state to an online pending state when a degraded link time interval expires and from the offline pending state to an offline state if all pending tasks on the plurality of first links are completed. The transition module further transitions the plurality of first links from the online pending state to the online state if each first link is validated.
摘要翻译：公开了用于链路维护的装置，系统和方法。多个状态机在数据管理节点之间操作多个第一链路，每个第一链路处于在线状态。过渡模块响应于脱机请求将多个第一链路从在线状态转换到退化状态，并且从在线状态转移到脱机挂起状态。当所述多个第一链路上的所有未完成的任务完成时，所述转换模块进一步将所述多个第一链路从劣化状态转换到在等待链路时间间隔期满并且从所述离线待命状态到脱机状态的在线挂起状态。如果每个第一链路被验证，则转换模块还将多个第一链路从在线挂起状态转换到在线状态。

19. 发明授权

US07975100B2 Segmentation of logical volumes and movement of selected segments when a cache storage is unable to store all segments of a logical volume 失效
标题翻译：当高速缓存存储器无法存储逻辑卷的所有段时，逻辑卷的分段和所选段的移动
公开(公告)号：US07975100B2
公开(公告)日：2011-07-05
申请号：US11841607
申请日：2007-08-20
申请人： Thomas William Bish , Gregory Tad Kishi , Jonathan Wayne Peake
发明人： Thomas William Bish , Gregory Tad Kishi , Jonathan Wayne Peake
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F3/0664 , G06F3/0613 , G06F3/0647 , G06F3/0685 , G06F12/0862 , G06F12/0866
摘要： Provided are a method, system, and article of manufacture, wherein a storage manager application implemented in a first computational device maintains a virtual logical volume that represents a plurality of segments of a linear storage medium of a secondary storage, wherein the virtual logical volume and the plurality of segments are created by the storage manager application. A request for data is received at the first computational device, from a second computational device. The storage manager application moves selected segments of the plurality of segments from the linear storage medium of the secondary storage to a cache storage, in anticipation that the requested data is included in the selected segments that are moved from the linear storage medium of the secondary storage to the cache storage.
摘要翻译：提供了一种方法，系统和制品，其中在第一计算设备中实现的存储管理器应用维护代表辅助存储器的线性存储介质的多个段的虚拟逻辑卷，其中虚拟逻辑卷和多个段由存储管理器应用程序创建。在第一计算设备处，从第二计算设备接收对数据的请求。存储管理器应用程序将所述多个段的所选段从辅助存储器的线性存储介质移动到高速缓存存储器，预期所请求的数据被包括在从辅助存储器的线性存储介质中移动的所选择的段中到缓存存储。

20. 发明申请

US20110145497A1 Cluster Families for Cluster Selection and Cooperative Replication 有权
标题翻译：群集选择和合作复制的群集
公开(公告)号：US20110145497A1
公开(公告)日：2011-06-16
申请号：US12635702
申请日：2009-12-11
申请人： Thomas William Bish , Takeshi Nohta , Joseph M. Swingler , Rufus-John Yeisuke Twito
发明人： Thomas William Bish , Takeshi Nohta , Joseph M. Swingler , Rufus-John Yeisuke Twito
IPC分类号： G06F12/16 , G06F12/00 , G06F12/08
CPC分类号： G06F3/0619 , G06F3/0604 , G06F3/0617 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F3/0683 , G06F3/0686 , G06F11/1464 , G06F11/2082 , G06F12/0802 , G06F12/0815 , G06F12/0866 , G06F2212/1016 , H04L67/1095 , H04L67/1097
摘要： An apparatus, system, and method are disclosed to create cluster families for cluster selection and cooperative replication. The clusters are grouped into family members of a cluster family base on their relationships and roles. Members of the cluster family determine which family member is in the best position to obtain replicated information and become cumulatively consistent within their cluster family. Once the cluster family becomes cumulatively consistent, the data is shared within the cluster family so that all copies within the cluster family are consistent.
摘要翻译：公开了一种设备，系统和方法来创建用于集群选择和协作复制的集群系列。集群根据其关系和角色归为群集系列的家族成员。集群系列的成员确定哪个家庭成员处于最佳位置以获得复制的信息，并在其集群系列中变得累积一致。一旦集群系列变得累积一致，则数据在集群系列内共享，以便集群系列内的所有副本都是一致的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式