会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Determining a winner of a race in a data processing system
    • 确定数据处理系统中的比赛获胜者
    • US5469575A
    • 1995-11-21
    • US961750
    • 1992-10-16
    • Hari H. Madduri
    • Hari H. Madduri
    • G06F9/46G06F12/14
    • G06F9/52Y10S707/99933Y10S707/99938Y10S707/99939
    • A first peer entity in a data processing system comprising a plurality of similar peer entities searches for a share control file for a system privilege. The share control file contains an address of a master entity which controls the system privilege. The plurality of entities may be either a plurality of peer processors or If the first entity does not find a share control file, it creates a share control file which contains its system and maintain an exclusive write lock on the storage control file address. Each subsequent entity competing for the system privilege will also search for the share control file. However, since the subsequent entities will find the share control file created by the first entity, these entities read the share control file for the address of the master entity. The invention may be used in a multi or single processor environment.
    • 包括多个类似对等实体的数据处理系统中的第一对等实体搜索用于系统特权的共享控制文件。 共享控制文件包含控制系统特权的主实体的地址。 多个实体可以是多个对等体处理器,或者如果第一实体没有找到共享控制文件,则它创建一个共享控制文件,该文件包含其系统并且保持对存储控制文件地址的独占写入锁定。 竞争系统权限的每个后续实体也将搜索共享控制文件。 然而,由于随后的实体将找到由第一实体创建的共享控制文件,所以这些实体读取共享控制文件以获取主实体的地址。 本发明可以在多处理器或单个处理器环境中使用。
    • 7. 发明授权
    • Updating replicated objects in a plurality of memory partitions
    • 更新多个内存分区中的复制对象
    • US5418966A
    • 1995-05-23
    • US961757
    • 1992-10-16
    • Hari H. Madduri
    • Hari H. Madduri
    • G06F12/00G06F3/14G06F9/46G06F9/52G06F15/16G06F15/177H04L12/18G06F13/14
    • G06F3/1454H04L12/1813G06F3/1423Y10S707/99938Y10S707/99952
    • Efficient update and presentation of a plurality of replicated data objects is accomplished with a write lock which moves among the replicas of a data object. After any necessary preparation for updating a data object, a shadow replica requests a write lock from the replica which currently holds the write lock or from the replica designated as the master replica. The write lock is moved to requesting shadow replica which performs an update to itself. The update is then reflected at the local system display to provide visual feedback to the user. The update is propagated to the other replicas which present the change at their associated displays. In the preferred embodiment, the write lock is retained at the replica which last requested the write lock as it is the most likely to receive the next update. While the invention finds particular application in a distributed data processing environment, it can also be used in a single processor having multiple replicas in separate memory partitions.
    • 通过在数据对象的副本之间移动的写锁来实现多个复制数据对象的有效更新和呈现。 在更新数据对象所需的准备工作之后,卷影副本从当前保存写入锁定的副本或从指定为主副本的副本请求写入锁定。 写锁定被移动到请求影子副本,该镜像对自身进行更新。 该更新然后反映在本地系统显示器上,以向用户提供视觉反馈。 该更新被传播到在其相关联的显示器上呈现更改的其他副本。 在优选实施例中,写锁定保留在最后请求写锁定的副本中,因为它最有可能接收下一更新。 虽然本发明在分布式数据处理环境中发现特定的应用,但是它也可以在具有分开的存储器分区中的多个副本的单个处理器中使用。
    • 8. 发明授权
    • Reallocating resource capacity among resource pools in a cloud computing environment
    • 在云计算环境中的资源池中重新分配资源容量
    • US08862738B2
    • 2014-10-14
    • US12906392
    • 2010-10-18
    • Hari H. MadduriRandy A. RendahlBrian J. Snitzer
    • Hari H. MadduriRandy A. RendahlBrian J. Snitzer
    • G06F9/50
    • H04L47/783G06F9/5011G06F9/5083G06F2209/5011H04L41/5006H04L41/5009H04L47/76H04L67/10
    • In general, the embodiments of the present invention provide an approach for rebalancing/reallocating cloud resource capacities between resource pools that provide variable customer assurances and delivery penalties when assurances are not met. The variables that are considered hereunder include, overall ‘reservations’, total current capacity, remaining capacity against unused reservations and penalties that apply for failing to satisfy ‘reservation’ commitments. The approach uses a rate of capacity consumption to calculate the risk of consuming the available capacity in each resource pool (e.g., resource pools allocated to satisfy different levels of service with different SLA failure penalties). Based on the relative available capacity in each pool (as determined by the pool rate of consumption), resources are reallocated to maximize revenue (e.g., reduce financial penalty) across a resource pool set.
    • 通常,本发明的实施例提供了一种用于在不满足保证时提供可变客户保证和递送惩罚的资源池之间的重新平衡/重新分配云资源容量的方法。 以下考虑的变量包括总体“保留”,总现有能力,对未使用的保留的剩余能力以及适用于不符合“保留”承诺的罚则。 该方法使用容量消耗率来计算消耗每个资源池中的可用容量的风险(例如,分配以满足具有不同SLA失败惩罚的不同服务等级的资源池)。 基于每个池中的相对可用容量(由池消费率确定),资源被重新分配以最大限度地利用资源池集合的收益(例如,减少财务损失)。