Action ordering

A non-transitory computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

• accessing a plurality of local queues, wherein each local queue of the plurality of local queues comprises one or more actions;
• obtaining a first action sequence from a first local queue of a first agent of a plurality of agents;
• obtaining a second action sequence from a second local queue of a second agent of the plurality of agents;
• identifying at least one action included in one of the first action sequence and the second action sequence but not included in both the first action sequence and the second action sequence;
• removing the at least one action from one of the first action sequence or the second action sequence;
• after removing the at least one action, applying an aggregation function to the plurality of local queues;
• based on the application of the aggregation function, determining an ordering of a plurality of actions comprising the one or more actions of each local queue, wherein the ordering comprises a first action being ordered before a second action;
• generating a shared queue based on the ordering of the plurality of actions, the shared queue comprising the first action at a first position of the shared queue and the second action at a second sequential position of the shared queue;
• computing a latency value that measures delay in traversing a distance between two or more agents of a distributed system;
• determining a topology of transactions at the distributed system based on:
• i) action sequences that are generated at the respective local queue of each agent, and ii) the latency value;
• generating an aggregate queue from the determined topology of transactions, the aggregate queue comprising a final ordering of the plurality of actions;
• and
• ordering transactions of the distributed system in a Directed Acyclic Graph (DAG) based on the final ordering of the plurality of actions in the aggregate queue.

A system, comprising:

• one or more processors;
• and
• machine-readable media interoperably coupled with the one or more processors and storing one or more instructions that, when executed by the one or more processors, perform operations comprising:
• accessing a plurality of local queues, wherein each local queue of the plurality of local queues comprises one or more actions;
• obtaining a first action sequence from a first local queue of a first agent of a plurality of agents;
• obtaining a second action sequence from a second local queue of a second agent of the plurality of agents;
• identifying at least one action included in one of the first action sequence and the second action sequence but not included in both the first action sequence and the second action sequence;
• removing the at least one action from one of the first action sequence or the second action sequence;
• after removing the at least one action, applying an aggregation function to the plurality of local queues;
• based on the application of the aggregation function, determining an ordering of a plurality of actions comprising the one or more actions of each local queue, wherein the ordering comprises a first action being ordered before a second action;
• generating a shared queue based on the ordering of the plurality of actions, the shared queue comprising the first action at a first position of the shared queue and the second action at a second sequential position of the shared queue;
• computing a latency value that measures delay in traversing a distance between two or more agents of a distributed system;
• determining a topology of transactions at the distributed system based on:
• i) action sequences that are generated at the respective local queue of each agent, and ii) the latency value;
• generating an aggregate queue from the determined topology of transactions, the aggregate queue comprising a final ordering of the plurality of actions;
• and
• ordering transactions of the distributed system in a Directed Acyclic Graph (DAG) based on the final ordering of the plurality of actions in the aggregate queue.