会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明申请
    • 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)邮票,当执行解雇规则列表中的一个撤销操作时,该邮票将被更新。 由于连续派遣,解雇行动会随着时间推移解除选择任务。
    • 24. 发明申请
    • PERSISTENT ITERATION OVER A DATABASE TREE STRUCTURE
    • 数据库树结构中的一致性迭代
    • US20130325902A1
    • 2013-12-05
    • US13489390
    • 2012-06-05
    • Yariv BACHARAviv KUVENTAsaf LEVY
    • Yariv BACHARAviv KUVENTAsaf LEVY
    • G06F7/00G06F17/30
    • G06F17/30961
    • Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node.
    • 在根据在数据库树结构中的父节点处按顺序增加的节点标识(ID)排列的节点上分阶段执行持续迭代。 在执行持续迭代时,存储持续迭代开始的节点的起始节点ID,正在经历持续迭代的节点的当前节点ID,正在经历持续迭代的节点的父节点ID,以及 表示当前级别的数值,并且所有级别大于正在进行持续迭代的当前节点级别。 在作为具有父节点ID的节点的子节点的节点上完成持续迭代时,返回到具有父节点ID的节点的子节点中的第一节点,按照增加节点ID的顺序,并执行持久性 每个节点的子节点的迭代。