Time ordered message serializer

A method for processing a plurality of vehicle messages, wherein the method is carried out by a remote server cluster that includes a timer serializer and a plurality of compute nodes, wherein the time serializer includes one or more processors and the plurality of compute nodes are implemented by at least one processor, wherein the method comprises:

• receiving a plurality of vehicle messages at the time serializer from one or more vehicles;
• storing a key-time pair including a key and a time indicator for each of the plurality of vehicle messages in a timer queue of the time serializer;
• storing each of the vehicle messages in a data structure that includes a priority queue for each key, and wherein each of the vehicle messages are stored in a priority queue that corresponds to the key that was generated for that vehicle message, wherein each of the priority queues are separate from the timer queue;
• receiving an indication that a compute node of the plurality of compute nodes is available to process a vehicle message;
• recalling a next key-time pair from the timer queue;
• determining whether a vehicle message with an associated key identical to the key of the next key-time pair is presently being processed in at least one compute node of the plurality of compute nodes by inspecting an in-flight table that is stored in memory of the remote server cluster, wherein the in-flight table stores one or more keys that correspond to one or more vehicle messages that are currently being processed;
• when it is determined that a vehicle message with an associated key identical to the key of the next key-time pair is presently being processed in at least one compute node, re-queueing the next key-time pair in the timer queue and repeating at least the recalling step for another next key-time pair;
• and
• when it is determined that a vehicle message with an associated key identical to the key of the next key-time pair is not presently being processed in at least one compute node, dispatching the oldest vehicle message in the priority queue that corresponds to the key of the next key-time pair to the compute node.

A method for processing a plurality of messages, wherein the method is carried out by a server cluster that includes a timer serializer and a plurality of compute nodes, wherein the time serializer includes one or more processors and the plurality of compute nodes are implemented by at least one processor, wherein the method comprises:

• receiving a plurality of time-sensitive messages from one or more remote devices at the server cluster;
• storing a key-time pair including a key and a time indicator for each of the plurality of messages in a timer queue of the time serializer;
• grouping messages with identical keys into the same time-sensitive set of messages using the time serializer;
• storing each of the messages in a data structure that includes a priority queue for each key, and wherein each of the messages are stored in a priority queue that corresponds to the key that was generated for that message;
• receiving an indication that processing of a message has been completed;
• recalling a next key-time pair from the timer queue;
• determining whether a message with a key identical to the key of the next key-time pair is presently being processed in at least one compute node of the plurality of compute nodes by inspecting an in-flight table that is stored in memory of the server cluster, wherein the in-flight table stores one or more keys that correspond to one or more messages that are currently being processed;
• when it is determined that a message with an associated key identical to the key of the next key-time pair is presently being processed in at least one compute node, re-queueing the next key-time pair in the timer queue and repeating at least the recalling step for another next key-time pair;
• and
• when it is determined that a vehicle message with an associated key identical to the key of the next key-time pair is not presently being processed in at least one compute node, dispatching the oldest message in the priority queue that corresponds to the key of the next key-time pair to a compute node of the plurality of compute nodes.