会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Capability requirements for group membership
    • 团体会员资格能力要求
    • US20080281954A1
    • 2008-11-13
    • US11801805
    • 2007-05-10
    • Prasad Bagal
    • Prasad Bagal
    • G06F15/173
    • H04L67/303
    • A method and apparatus for adding a node to a group of nodes is provided. Group capability data is stored in volatile memory of a group manager for a group. The group capability data identifies capability requirements for members of the group. The group manager provides notification services for members of the group. A request to add a particular node to a group is received. In response to receiving the request, a determination is made as to whether the particular node satisfies the capability requirements identified by the group capability data. Upon determining that the particular node does satisfy the capability requirements identified by the group capability data, the particular node is added to the group. The capability requirements for members of a group may initially be based on the capabilities of the first node that is added to a group.
    • 提供了一种用于将节点添加到一组节点的方法和装置。 组能力数据存储在组的组管理器的易失性存储器中。 组能力数据识别组成员的能力要求。 集团经理为集团成员提供通知服务。 接收到将特定节点添加到组的请求。 响应于接收到请求,确定特定节点是否满足由组能力数据识别的能力要求。 在确定特定节点确实满足由组能力数据识别的能力要求时,特定节点被添加到组中。 组的成员的能力要求可以最初基于添加到组的第一节点的能力。
    • 4. 发明申请
    • ASSIGNING READ REQUESTS BASED ON BUSYNESS OF DEVICES
    • 根据设备的繁琐准备阅读要求
    • US20120159094A1
    • 2012-06-21
    • US12975242
    • 2010-12-21
    • Willliam H. Bridge, JR.Prasad BagalLavina JainRajiv WickremesingheDarshan NagarajappaRichard L. Long
    • Willliam H. Bridge, JR.Prasad BagalLavina JainRajiv WickremesingheDarshan NagarajappaRichard L. Long
    • G06F12/00G06F11/20
    • G06F3/0617G06F3/0653G06F3/0683G06F11/2053G06F11/2094G06F11/3433
    • Techniques are provided for assigning read requests to storage devices in a manner that reduces the likelihood that any storage device will become overloaded or underutilized. Specifically, a read-request handler assigns read requests that are directed to each particular item among the storage devices that have copies of the item based on how busy each of those storage devices is. Consequently, even though certain storage devices may have copies of the same item, there may be times during which one storage device is assigned a disproportionate number of the reads of the item because the other storage device is busy with read requests for other items, and there may be other times during which other storage device is assigned a disproportionate number of the reads of the item because the one storage device is busy with read request for other items. Various techniques for estimating the busyness of storage devices are provided, including fraction-based estimates, interval-based estimates, and the response-time-based estimates. Techniques for smoothing those estimates, and for handicapping devices, are also provided.
    • 提供了以减少任何存储设备将变得过载或未充分利用的可能性的方式将读请求分配给存储设备的技术。 具体地说,读取请求处理程序根据这些存储设备的忙碌来分配针对具有项目副本的存储设备中的每个特定项目的读取请求。 因此,尽管某些存储设备可能具有相同项目的副本,但是由于另一个存储设备忙于对其他项目的读取请求,所以可能存在一个存储设备被分配了不成比例的该项目的读取的次数,以及 可能存在其他存储设备被分配了不成比例数量的项目的其他时间,因为一个存储设备忙于对其他项目的读取请求。 提供了用于估计存储设备的繁忙性的各种技术,包括基于分数的估计,基于间隔的估计和基于响应时间的估计。 还提供了用于平滑这些估计的技术和用于障碍装置的技术。
    • 6. 发明授权
    • Capability requirements for group membership
    • 团体会员资格能力要求
    • US07805503B2
    • 2010-09-28
    • US11801805
    • 2007-05-10
    • Prasad Bagal
    • Prasad Bagal
    • G06F15/177G06F15/173
    • H04L67/303
    • A method and apparatus for adding a node to a group of nodes is provided. Group capability data is stored in volatile memory of a group manager for a group. The group capability data identifies capability requirements for members of the group. The group manager provides notification services for members of the group. A request to add a particular node to a group is received. In response to receiving the request, a determination is made as to whether the particular node satisfies the capability requirements identified by the group capability data. Upon determining that the particular node does satisfy the capability requirements identified by the group capability data, the particular node is added to the group. The capability requirements for members of a group may initially be based on the capabilities of the first node that is added to a group.
    • 提供了一种用于将节点添加到一组节点的方法和装置。 组能力数据存储在组的组管理器的易失性存储器中。 组能力数据识别组成员的能力要求。 集团经理为集团成员提供通知服务。 接收到将特定节点添加到组的请求。 响应于接收到请求,确定特定节点是否满足由组能力数据识别的能力要求。 在确定特定节点确实满足由组能力数据识别的能力要求时,特定节点被添加到组中。 组的成员的能力要求可以最初基于添加到组的第一节点的能力。
    • 7. 发明授权
    • Efficient volume manager hot swapping
    • 高效的卷管理器热插拔
    • US08392915B2
    • 2013-03-05
    • US12274203
    • 2008-11-19
    • David FriedmanPrasad Bagal
    • David FriedmanPrasad Bagal
    • G06F9/455
    • G06F12/16G06F3/0631G06F3/0665G06F9/4856
    • Methods of hot-swapping a logical volume manager (LVM) and updating an associated extent map are presented. Methods for migrating a virtual machine running an application using an LVM from one physical machine to another physical machine are also presented. The LVM can be used by a database application or other applications in a single-node or multi-node environment. The LVM is shut down, version numbers for each segment of its associated extent map are saved, and a new LVM is started. The new LVM's extent map is compared with the old extent map, and segments in the LVM which have changed are selectively updated.
    • 介绍了热交换逻辑卷管理器(LVM)和更新相关扩展图的方法。 还介绍了将使用LVM运行应用程序的虚拟机从一台物理机器迁移到另一台物理机器的方法。 LVM可以由数据库应用程序或单节点或多节点环境中的其他应用程序使用。 关闭LVM,将保存其关联扩展图的每个段的版本号,并启动一个新的LVM。 将新的LVM的范围图与旧的扩展图进行比较,并且LVM中已更改的段被选择性更新。
    • 8. 发明授权
    • Assigning read requests based on busyness of devices
    • 根据设备的忙碌分配读取请求
    • US09141508B2
    • 2015-09-22
    • US12975242
    • 2010-12-21
    • Willliam H. Bridge, Jr.Prasad BagalLavina JainRajiv WickremesingheDarshan NagarajappaRichard L. Long
    • Willliam H. Bridge, Jr.Prasad BagalLavina JainRajiv WickremesingheDarshan NagarajappaRichard L. Long
    • G06F12/00G06F11/20G06F11/34
    • G06F3/0617G06F3/0653G06F3/0683G06F11/2053G06F11/2094G06F11/3433
    • Techniques are provided for assigning read requests to storage devices in a manner that reduces the likelihood that any storage device will become overloaded or underutilized. Specifically, a read-request handler assigns read requests that are directed to each particular item among the storage devices that have copies of the item based on how busy each of those storage devices is. Consequently, even though certain storage devices may have copies of the same item, there may be times during which one storage device is assigned a disproportionate number of the reads of the item because the other storage device is busy with read requests for other items, and there may be other times during which other storage device is assigned a disproportionate number of the reads of the item because the one storage device is busy with read request for other items. Various techniques for estimating the busyness of storage devices are provided, including fraction-based estimates, interval-based estimates, and the response-time-based estimates. Techniques for smoothing those estimates, and for handicapping devices, are also provided.
    • 提供了以减少任何存储设备将变得过载或未充分利用的可能性的方式将读请求分配给存储设备的技术。 具体地说,读取请求处理程序根据这些存储设备的忙碌来分配针对具有项目副本的存储设备中的每个特定项目的读取请求。 因此,尽管某些存储设备可能具有相同项目的副本,但是由于另一个存储设备忙于对其他项目的读取请求,所以可能存在一个存储设备被分配了不成比例的该项目的读取的次数,以及 可能存在其他存储设备被分配了不成比例数量的项目的其他时间,因为一个存储设备忙于对其他项目的读取请求。 提供了用于估计存储设备的繁忙性的各种技术,包括基于分数的估计,基于间隔的估计和基于响应时间的估计。 还提供了用于平滑这些估计的技术和用于障碍装置的技术。