Dynamic execution log in a distributed system
    1.
    发明授权
    Dynamic execution log in a distributed system 有权
    分布式系统中的动态执行日志

    公开(公告)号:US09317323B2

    公开(公告)日:2016-04-19

    申请号:US13727401

    申请日:2012-12-26

    CPC classification number: G06F9/4843

    Abstract: Scheduling and dispatching jobs for a plurality of different entities. A method includes receiving at a work coordinator, one or more actions associated with a job. The method further includes storing in a log at the work coordinator, keyed on a job key, state for the one or more actions and a list of the one or more actions. The method further includes making calls to one or more worker processes to cause the worker process to perform actions associated with the job. As a result of making calls to one or more worker processes, the method further includes receiving at least one of a change to the list of remaining actions or the state.

    Abstract translation: 多个不同实体的调度和调度作业。 一种方法包括在工作协调器处接收与作业相关联的一个或多个动作。 该方法还包括存储在工作协调器的日志中,键入作业密钥,用于一个或多个动作的状态和一个或多个动作的列表。 该方法还包括对一个或多个工作进程进行调用以使工作进程执行与作业相关联的动作。 作为对一个或多个工作进程的调用的结果,该方法还包括接收对剩余动作列表或状态的改变中的至少一个。

    Quorum Based Reliable Low Latency Storage
    2.
    发明申请

    公开(公告)号:US20180060195A1

    公开(公告)日:2018-03-01

    申请号:US15289825

    申请日:2016-10-10

    Abstract: Representative embodiments disclose a consistent, low latency, reliable storage system that uses quorum logic. An odd number of storage nodes are selected to store data for a client application. The odd number allows a quorum to be determined. When data is written to the storage nodes, success is identified if the data is successfully written to a majority of the storage nodes. Similarly, when a read is performed, success is identified if the majority of the storage nodes return the same value written in the same write operation. This is determined by matching a value and a version number for each node. Additional data is written to the storage nodes along with the values to allow the system to identify and repair inconsistencies in the data. In some embodiments, both the current data and prior data are stored to aid in repairing inconsistent data.

    Consistent modeling and execution of time constructs in business processes
    3.
    发明授权
    Consistent modeling and execution of time constructs in business processes 有权
    业务流程中时间结构的一致建模和执行

    公开(公告)号:US09304888B2

    公开(公告)日:2016-04-05

    申请号:US13926372

    申请日:2013-06-25

    CPC classification number: G06F11/34 G06F9/4843 G06Q10/06

    Abstract: Embodiments are directed to executing a workflow using a virtualized clock and to ensuring idempotency and correctness among workflow processes. In one scenario, a computer system a computer system determines that a workflow session has been initialized. The workflow session runs as a set of episodes, where each episode includes one or more pulses of work that are performed when triggered by an event. Each workflow session is processed according to a virtualized clock that keeps a virtual session time for the workflow session. The computer system receives an event that includes an indication of the time the event was generated, and then accesses the received event to determine which pulses of work are to be performed as part of a workflow session episode. The computer system then executes the determined pulses of work according to the virtual session time indicated by the virtualized clock.

    Abstract translation: 实施例涉及使用虚拟化时钟来执行工作流并确保工作流程中的幂等和正确性。 在一种情况下,计算机系统计算机系统确定工作流会话已被初始化。 工作流会话作为一组剧集运行,其中每集包括当事件触发时执行的一个或多个工作脉冲。 根据保持工作流会话的虚拟会话时间的虚拟化时钟处理每个工作流会话。 计算机系统接收包括生成事件的时间的指示的事件,然后访问接收到的事件以确定作为工作流会话事件的一部分执行哪个工作脉冲。 计算机系统然后根据由虚拟化时钟指示的虚拟会话时间执行所确定的工作脉冲。

    Quorum based reliable low latency storage

    公开(公告)号:US10229015B2

    公开(公告)日:2019-03-12

    申请号:US15289825

    申请日:2016-10-10

    Abstract: Representative embodiments disclose a consistent, low latency, reliable storage system that uses quorum logic. An odd number of storage nodes are selected to store data for a client application. The odd number allows a quorum to be determined. When data is written to the storage nodes, success is identified if the data is successfully written to a majority of the storage nodes. Similarly, when a read is performed, success is identified if the majority of the storage nodes return the same value written in the same write operation. This is determined by matching a value and a version number for each node. Additional data is written to the storage nodes along with the values to allow the system to identify and repair inconsistencies in the data. In some embodiments, both the current data and prior data are stored to aid in repairing inconsistent data.

Patent Agency Ranking