Ordered execution of tasks
Abstract:
Systems and methods for synchronizing a network are described. Multiple nodes, for example, may execute tasks (e.g., updates) in an order based on task identifiers and/or local clock values for each of the nodes. When a node receives a task, it may determine whether to execute the task or to store the task for future execution. Nodes may generate identifiers for the task and send the task and identifier to one or more other nodes, such as via a gossip protocol.
Public/Granted literature
Information query
Patent Agency Ranking
0/0