会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING
    • 在任务调度中选择性的常量复杂性
    • US20120047507A1
    • 2012-02-23
    • US12859467
    • 2010-08-19
    • Yariv BACHARIlai HARSGOR-HENDINEhud MEIRIOded SONIN
    • Yariv BACHARIlai HARSGOR-HENDINEhud MEIRIOded SONIN
    • G06F9/46
    • G06F9/4881G06F2209/486
    • Various embodiments for selective constant complexity dismissal in task scheduling of a plurality of tasks are provided. A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch.
    • 提供了用于多个任务的任务调度中的选择性恒定复杂度解除的各种实施例。 执行严格增加的功能以产生多个独特的创建邮票,所述多个独特的创建邮票中的每一个随着时间的推移随着严格增加的功能而增加。 用多个任务放置的新任务用多个独特的创建标记的新的唯一创建印记标记。 解雇规则清单中的一个包含最小有效的创建(MVC)邮票,当执行解雇规则列表中的一个撤销操作时,该邮票将被更新。 由于连续派遣,解雇行动会随着时间推移解除选择任务。
    • 4. 发明申请
    • DEDUPLICATED DATA PROCESSING CONGESTION CONTROL
    • 重复数据处理控制
    • US20110273982A1
    • 2011-11-10
    • US12773136
    • 2010-05-04
    • Shay H. AKIRAVYariv BACHARAsaf LEVYEhud MEIRI
    • Shay H. AKIRAVYariv BACHARAsaf LEVYEhud MEIRI
    • H04L12/56
    • H04L47/122G06F17/30943H04L67/1095H04L67/1097
    • Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. The congestion limit is calculated from a comparison of the single congestion metric to a congestion target setpoint, the congestion target setpoint being a virtual dimension setpoint and the congestion limit being a manipulated variable. The number of active deduplicated data processes is compared to the congestion limit. If the number of active deduplicated data processes is less than the congestion limit, a new deduplicated data process is spawned.
    • 提供了在计算环境中用于重复数据删除的数据处理拥塞控制的各种实施例。 在一个这样的实施例中,从多个主动去重复数据处理的多个组合的重复数据删除的数据处理拥塞统计的采样中确定单个拥塞度量。 从单个拥塞度量与拥塞目标设定点的比较计算拥塞限制,拥挤目标设定点是虚拟维度设定点,拥挤限制是操纵变量。 将活动重复数据消除的数据流程的数量与拥塞限制进行比较。 如果活动重复数据删除的数据流程数量小于拥塞限制,则会产生一个新的重复数据删除数据流程。
    • 6. 发明申请
    • RESOURCE ALLOCATION FOR A PLURALITY OF RESOURCES FOR A DUAL ACTIVITY SYSTEM
    • 资源分配用于双重活动系统的资源多样性
    • US20120311598A1
    • 2012-12-06
    • US13151075
    • 2011-06-01
    • Yariv BACHARRon EDELSTEINOded SONIN
    • Yariv BACHARRon EDELSTEINOded SONIN
    • G06F9/50
    • G06F9/50G06F9/5083G06F2209/504Y02D10/22
    • Exemplary method, system, and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.
    • 提供了用于由处理器设备为双重活动系统的多个资源的资源分配的示例性方法,系统和计算机程序产品实施例。 在一个实施例中,仅作为示例,每个活动可以以静态配额开始。 对于针对至少一个双重活动的资源请求,资源边界可以被增加,直到双重活动中的至少一个的另一个活动的资源请求被拒绝为止。 为了响应对双重活动中的至少一个的替代方案的资源请求的拒绝,可以减少双重活动中的至少一个的资源边界,并且可以开始减小模式之后的等待直到 当前的资源使用量小于和等于资源边界的减少。