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

1. 发明授权

US08924967B2 Maintaining high availability of a group of virtual machines using heartbeat messages 有权
标题翻译：使用心跳消息维护一组虚拟机的高可用性
公开(公告)号：US08924967B2
公开(公告)日：2014-12-30
申请号：US13096188
申请日：2011-04-28
申请人： Michael Nelson , Keith Farkas , Elisha Ziskind , Sridhar Rajagopal , Guoqiang Shu , Ron Passerini , Joanne Ren
发明人： Michael Nelson , Keith Farkas , Elisha Ziskind , Sridhar Rajagopal , Guoqiang Shu , Ron Passerini , Joanne Ren
IPC分类号： G06F15/173 , G06F9/455 , G06F9/46 , G06F11/00 , G06F9/54
CPC分类号： G06F11/1438 , G06F9/45533 , G06F9/542 , G06F11/0757
摘要： Embodiments maintain high availability of software application instances in a fault domain. Subordinate hosts are monitored by a master host. The subordinate hosts publish heartbeats via a network and datastores. Based at least in part on the published heartbeats, the master host determines the status of each subordinate host, distinguishing between subordinate hosts that are entirely inoperative and subordinate hosts that are operative but partitioned (e.g., unreachable via the network). The master host may restart software application instances, such as virtual machines, that are executed by inoperative subordinate hosts or that cease executing on partitioned subordinate hosts.
摘要翻译：实施例在故障域中保持软件应用程序实例的高可用性。主机由主机监控。下级主机通过网络和数据存储发布心跳。至少部分地基于所发布的心跳，主主机确定每个从属主机的状态，区分完全不起作用的下级主机和可操作但被分区的下级主机（例如，经由网络不可达）。主主机可以重新启动由不能操作的下属主机执行的软件应用程序实例，例如虚拟机，或者停止在分区的下级主机上执行。

2. 发明授权

US07904428B2 Methods and apparatus for recording write requests directed to a data store 有权
标题翻译：用于记录指向数据存储的写请求的方法和装置
公开(公告)号：US07904428B2
公开(公告)日：2011-03-08
申请号：US10924668
申请日：2004-08-24
申请人： Robert Perry , Ron Passerini , Michael Rowan
发明人： Robert Perry , Ron Passerini , Michael Rowan
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F11/1469 , G06F11/1461 , G06F11/1471 , G06F2201/80
摘要： A storage management device records write requests that are directed to a data store. In one embodiment, the storage management device records a plurality of write request entries, each one of which includes information relating to a write request, in at least one first database table, and maintains, for each first database table, at least one record in a second database table. The one or more records in the second database table include data representing the effects of the write requests on a state of at least one portion of the data store. In one such embodiment, each time that one write request entry is recorded in one first database table, the storage management device updates at least one record in the second database table.
摘要翻译：存储管理设备记录指向数据存储的写入请求。在一个实施例中，存储管理设备在至少一个第一数据库表中记录多个写入请求条目，每个写入请求条目包括与写入请求有关的信息，并且为每个第一数据库表保存至少一个记录第二个数据库表。第二数据库表中的一个或多个记录包括表示写入请求对数据存储器的至少一部分的状态的影响的数据。在一个这样的实施例中，每当一个写请求条目被记录在一个第一数据库表中时，存储管理装置更新第二数据库表中的至少一个记录。

3. 发明申请

US20050066118A1 Methods and apparatus for recording write requests directed to a data store 有权
标题翻译：用于记录指向数据存储的写请求的方法和装置
公开(公告)号：US20050066118A1
公开(公告)日：2005-03-24
申请号：US10924668
申请日：2004-08-24
申请人： Robert Perry , Ron Passerini , Michael Rowan
发明人： Robert Perry , Ron Passerini , Michael Rowan
IPC分类号： G06F11/00 , G06F12/00 , G06F12/16 , G06F17/00 , H04L12/54
CPC分类号： G06F11/1469 , G06F11/1461 , G06F11/1471 , G06F2201/80
摘要： A storage management device records write requests that are directed to a data store. In one embodiment, the storage management device records a plurality of write request entries, each one of which includes information relating to a write request, in at least one first database table, and maintains, for each first database table, at least one record in a second database table. The one or more records in the second database table include data representing the effects of the write requests on a state of at least one portion of the data store. In one such embodiment, each time that one write request entry is recorded in one first database table, the storage management device updates at least one record in the second database table.
摘要翻译：存储管理设备记录指向数据存储的写入请求。在一个实施例中，存储管理设备在至少一个第一数据库表中记录多个写入请求条目，每个写入请求条目包括与写入请求有关的信息，并且为每个第一数据库表保存至少一个记录第二个数据库表。第二数据库表中的一个或多个记录包括表示写入请求对数据存储器的至少一部分的状态的影响的数据。在一个这样的实施例中，每当一个写请求条目被记录在一个第一数据库表中时，存储管理装置更新第二数据库表中的至少一个记录。

4. 发明申请

US20060047999A1 Generation and use of a time map for accessing a prior image of a storage device 有权
标题翻译：生成和使用用于访问存储设备的先前映像的时间映射
公开(公告)号：US20060047999A1
公开(公告)日：2006-03-02
申请号：US10924655
申请日：2004-08-24
申请人： Ron Passerini , Tianming Zhang
发明人： Ron Passerini , Tianming Zhang
IPC分类号： G06F12/16
CPC分类号： G06F11/1461 , G06F11/1458 , G06F11/1464 , Y10S707/99931 , Y10S707/99953
摘要： The invention relates to systems, methods, and articles of manufacture for generating an image of a data store at a past time by using a map (e.g., a time map) of the locations of data stored in the data store at the specified past time. The map allows the data storage system to quickly determine the locations of data stored in a data store at a past time, without searching the entire index of records concerning the locations of the past data.
摘要翻译：本发明涉及通过使用在指定的过去时间存储在数据存储中的数据的位置的映射（例如，时间映射）来在过去时间生成数据存储的图像的系统，方法和制品。地图允许数据存储系统在过去的时间快速地确定存储在数据存储中的数据的位置，而不搜索关于过去数据的位置的整个记录索引。

5. 发明申请

US20120278801A1 MAINTAINING HIGH AVAILABILITY OF A GROUP OF VIRTUAL MACHINES USING HEARTBEAT MESSAGES 有权
标题翻译：使用心跳信息维护一组虚拟机的高可用性
公开(公告)号：US20120278801A1
公开(公告)日：2012-11-01
申请号：US13096188
申请日：2011-04-28
申请人： Michael NELSON , Keith Farkas , Elisha Ziskind , Sridhar Rajagopal , Guoqiang Shu , Ron Passerini , Joanne Ren
发明人： Michael NELSON , Keith Farkas , Elisha Ziskind , Sridhar Rajagopal , Guoqiang Shu , Ron Passerini , Joanne Ren
IPC分类号： G06F9/455
CPC分类号： G06F11/1438 , G06F9/45533 , G06F9/542 , G06F11/0757
摘要： Embodiments maintain high availability of software application instances in a fault domain. Subordinate hosts are monitored by a master host. The subordinate hosts publish heartbeats via a network and datastores. Based at least in part on the published heartbeats, the master host determines the status of each subordinate host, distinguishing between subordinate hosts that are entirely inoperative and subordinate hosts that are operative but partitioned (e.g., unreachable via the network). The master host may restart software application instances, such as virtual machines, that are executed by inoperative subordinate hosts or that cease executing on partitioned subordinate hosts.
摘要翻译：实施例在故障域中保持软件应用程序实例的高可用性。主机由主机监控。下级主机通过网络和数据存储发布心跳。至少部分地基于所发布的心跳，主主机确定每个从属主机的状态，区分完全不起作用的从属主机和可操作但被分区的下级主机（例如，经由网络不可达）。主主机可以重新启动由不能操作的下属主机执行的软件应用程序实例，例如虚拟机，或者停止在分区的下级主机上执行。

6. 发明授权

US07827362B2 Systems, apparatus, and methods for processing I/O requests 有权
标题翻译：用于处理I / O请求的系统，设备和方法
公开(公告)号：US07827362B2
公开(公告)日：2010-11-02
申请号：US10924656
申请日：2004-08-24
申请人： Ron Passerini
发明人： Ron Passerini
IPC分类号： G06F13/16
CPC分类号： G06F3/0659 , G06F3/0622 , G06F3/0656 , G06F3/0683
摘要： A method, apparatus, and system for accessing units of storage in at least one logical unit by processing I/O requests directed to the logical units using a LUN queue and an operation-type queue. By using the queues to process the I/O requests, the requests can be processed without address collisions.
摘要翻译：一种用于通过使用LUN队列和操作类型队列处理针对逻辑单元的I / O请求来访问至少一个逻辑单元中的存储单元的方法，装置和系统。通过使用队列来处理I / O请求，可以处理请求而不发生地址冲突。

7. 发明申请

US20060047902A1 Processing storage-related I/O requests using binary tree data structures 有权
标题翻译：使用二叉树数据结构处理与存储有关的I / O请求
公开(公告)号：US20060047902A1
公开(公告)日：2006-03-02
申请号：US10924582
申请日：2004-08-24
申请人： Ron Passerini
发明人： Ron Passerini
IPC分类号： G06F12/16
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0613 , G06F3/0656 , G06F3/0689 , G06F11/1456 , G06F11/1464 , G06F11/1469
摘要： The disclosed technology can be used to develop systems and perform methods that receive and process I/O requests directed to at least a part of a logical unit of storage. The I/O requests can be associated with different times corresponding to when such I/O requests were received. Nodes that include non-overlapping address ranges associated with the logical unit of storage can be formed in response to receiving the I/O requests and such nodes can be subsequently organized into a tree data structure. The tree data structure can serve as a basis for determining address overlap, for example to enable processing a first operation associated with a first one of the I/O requests in accordance with the first I/O request's receipt time, while one or more other operations associated with a different I/O request may be processed irrespective of that different I/O request's receipt time. This can be useful in a system in system operations are improved by easy access to information about whether pending I/O requests are directed to overlapping units of storage.
摘要翻译：所公开的技术可用于开发系统并执行接收和处理针对至少一部分逻辑存储单元的I / O请求的方法。 I / O请求可以与在接收到这种I / O请求时对应的不同时间相关联。可以响应于接收到I / O请求而形成包括与存储的逻辑单元相关联的非重叠地址范围的节点，并且这些节点可以随后被组织成树状数据结构。树数据结构可以用作确定地址重叠的基础，例如，以便能够根据第一I / O请求的接收时间处理与第一个I / O请求相关联的第一操作，而一个或多个其他可以处理与不同的I / O请求相关联的操作，而不管I / O请求的接收时间如何。这在系统中的系统操作可能是有用的，通过容易地访问关于挂起的I / O请求是否被定向到重叠的存储单元的信息来改进。

8. 发明授权

US07730222B2 Processing storage-related I/O requests using binary tree data structures 有权
标题翻译：使用二叉树数据结构处理与存储有关的I / O请求
公开(公告)号：US07730222B2
公开(公告)日：2010-06-01
申请号：US10924582
申请日：2004-08-24
申请人： Ron Passerini
发明人： Ron Passerini
IPC分类号： G06F3/00 , G06F9/00 , G06F9/44
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0613 , G06F3/0656 , G06F3/0689 , G06F11/1456 , G06F11/1464 , G06F11/1469
摘要： The disclosed technology can be used to develop systems and perform methods that receive and process I/O requests directed to at least a part of a logical unit of storage. The I/O requests can be associated with different times corresponding to when such I/O requests were received. Nodes that include non-overlapping address ranges associated with the logical unit of storage can be formed in response to receiving the I/O requests and such nodes can be subsequently organized into a tree data structure. The tree data structure can serve as a basis for determining address overlap, for example to enable processing a first operation associated with a first one of the I/O requests in accordance with the first I/O request's receipt time, while one or more other operations associated with a different I/O request may be processed irrespective of that different I/O request's receipt time. This can be useful in a system in system operations are improved by easy access to information about whether pending I/O requests are directed to overlapping units of storage.
摘要翻译：所公开的技术可用于开发系统并执行接收和处理针对至少一部分逻辑存储单元的I / O请求的方法。 I / O请求可以与在接收到这种I / O请求时对应的不同时间相关联。可以响应于接收到I / O请求而形成包括与存储的逻辑单元相关联的非重叠地址范围的节点，并且这些节点可以随后被组织成树状数据结构。树数据结构可以用作确定地址重叠的基础，例如，以便能够根据第一I / O请求的接收时间处理与第一个I / O请求相关联的第一操作，而一个或多个其他可以处理与不同的I / O请求相关联的操作，而不管I / O请求的接收时间如何。这在系统中的系统操作可能是有用的，通过容易地访问关于挂起的I / O请求是否被定向到重叠的存储单元的信息来改进。

9. 发明授权

US07296008B2 Generation and use of a time map for accessing a prior image of a storage device 有权
标题翻译：生成和使用用于访问存储设备的先前映像的时间映射
公开(公告)号：US07296008B2
公开(公告)日：2007-11-13
申请号：US10924655
申请日：2004-08-24
申请人： Ron Passerini , Tianming Zhang
发明人： Ron Passerini , Tianming Zhang
IPC分类号： G06F7/00 , G06F9/26
CPC分类号： G06F11/1461 , G06F11/1458 , G06F11/1464 , Y10S707/99931 , Y10S707/99953
摘要： The invention relates to systems, methods, and articles of manufacture for generating an image of a data store at a past time by using a map (e.g., a time map) of the locations of data stored in the data store at the specified past time. The map allows the data storage system to quickly determine the locations of data stored in a data store at a past time, without searching the entire index of records concerning the locations of the past data.
摘要翻译：本发明涉及通过使用在指定的过去时间存储在数据存储中的数据的位置的映射（例如，时间映射）来在过去时间生成数据存储的图像的系统，方法和制品。地图允许数据存储系统在过去的时间快速地确定存储在数据存储中的数据的位置，而不搜索关于过去数据的位置的整个记录索引。

10. 发明申请

US20060047903A1 Systems, apparatus, and methods for processing I/O requests 有权
标题翻译：用于处理I / O请求的系统，设备和方法
公开(公告)号：US20060047903A1
公开(公告)日：2006-03-02
申请号：US10924656
申请日：2004-08-24
申请人： Ron Passerini
发明人： Ron Passerini
IPC分类号： G06F12/00
CPC分类号： G06F3/0659 , G06F3/0622 , G06F3/0656 , G06F3/0683
摘要： A method, apparatus, and system for accessing units of storage in at least one logical unit by processing I/O requests directed to the logical units using a LUN queue and an operation-type queue. By using the queues to process the I/O requests, the requests can be processed without address collisions.
摘要翻译：一种用于通过使用LUN队列和操作类型队列处理针对逻辑单元的I / O请求来访问至少一个逻辑单元中的存储单元的方法，装置和系统。通过使用队列来处理I / O请求，可以处理请求而不发生地址冲突。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式