US 11,902,832 B1Granted

Ordering multiple commands issued by multiple computing devices in a network, when chronological ordering is not possible

AssigneeSpiderOak, Inc.

InventorJonathan Andrew Crockett Moore

Life of this patent

Estimating the term…

Loading patent…

Abstract

The system obtains an acyclic graph including multiple nodes and edges. An edge indicates a parent node and a child node to be included in a weave indicating a linear order of the multiple nodes. The parent node occurs before the child node in the weave. The acyclic graph includes a branch node having a first and a second child node that do not have a parent-child relationship indicating the weave. The system orders the multiple nodes in the acyclic graph by ordering a portion of the multiple nodes according to a portion of the multiple edges. The system orders the first child node and the second child node by obtaining a first priority associated with the first child node and a second priority associated with the second child node and, based on the first and second priority, creating the weave by ordering the first and second child node.

Claims22

Dependent claims

A non-transitory, computer-readable storage medium comprising instructions to order multiple commands issued by multiple computing devices in a network, when chronological ordering is not possible, wherein the instructions, when executed by at least one processor of a system, cause the system to:

obtain a directed acyclic graph including multiple nodes and multiple edges,
wherein a node in the directed acyclic graph represents a command issued by a computing device in the network,
wherein an edge among the multiple edges indicates a parent node among the multiple nodes and a child node among the multiple nodes to be included in a weave indicating a linear order of the multiple nodes,
wherein the parent node occurs before the child node in the weave,
wherein the directed acyclic graph includes a branch node having a first child node and a second child node,
wherein the first child node and the second child node do not have a parent-child relationship indicating the weave;
order the multiple nodes in the directed acyclic graph by ordering a portion of the multiple nodes according to at least a portion of the multiple edges;
and
order the first child node and the second child node by:
obtaining a first priority associated with a first command represented by the first child node and a second priority associated with a second command represented by the second child node;
and
based on the first priority and the second priority, creating the weave by ordering the first command and the second command.

9 more elements

A method comprising:

obtaining an acyclic graph including multiple nodes and multiple edges,
wherein an edge among the multiple edges indicates a parent node among the multiple nodes and a child node among the multiple nodes to be included in a weave,
wherein the parent node occurs before the child node in the weave,
wherein the acyclic graph includes a branch node having a first child node and a second child node,
wherein the first child node and the second child node do not have a parent-child relationship indicating the weave;
ordering the multiple nodes in the acyclic graph by ordering a portion of the multiple nodes according to at least a portion of the multiple edges;
and
ordering the first child node and the second child node by:
obtaining a first priority associated with the first child node and a second priority associated with the second child node;
based on the first priority and the second priority, creating the weave by ordering the first child node and the second child node.

7 more elements

A system comprising:

at least one hardware processor;
and
at least one non-transitory memory storing instructions, which, when executed by the at least one hardware processor, cause the system to:
obtain an acyclic graph including multiple nodes and multiple edges,
wherein an edge among the multiple edges indicates a parent node among the multiple nodes and a child node among the multiple nodes to be included in a weave,
wherein the parent node occurs before the child node in the weave,
wherein the acyclic graph includes a branch node having a first child node and a second child node,
wherein the first child node and the second child node do not have a parent-child relationship indicating the weave;
order the multiple nodes in the acyclic graph by ordering a portion of the multiple nodes according to at least a portion of the multiple edges;
and
order the first child node and the second child node by:
obtaining a first priority associated with the first child node and a second priority associated with the second child node;
based on the first priority and the second priority, creating the weave by ordering the first child node and the second child node.

10 more elements

Dependencies are inferred from the claim text.