US 12,236,484 B2
Order matching
Hannes Jörgen Edvardson, Uppsala (SE)
Assigned to Nasdaq Technology AB, Stockholm (SE)
Filed by NASDAQ TECHNOLOGY AB, Stockholm (SE)
Filed on Jan. 14, 2021, as Appl. No. 17/149,508.
Application 17/149,508 is a continuation of application No. 13/520,362, abandoned, previously published as PCT/EP2011/050072, filed on Jan. 4, 2011.
Claims priority of application No. 10150065 (EP), filed on Jan. 4, 2010; and application No. 1000047 (GB), filed on Jan. 4, 2010.
Prior Publication US 2021/0209690 A1, Jul. 8, 2021
Int. Cl. G06Q 40/06 (2012.01); G06Q 40/04 (2012.01)
CPC G06Q 40/06 (2013.01) [G06Q 40/04 (2013.01)] 20 Claims
OG exemplary drawing
 
1. An automated data processing system, comprising:
an interface configured to receive a plurality of electronic request instructions over a network from a plurality of networked computer terminals comprising first type request instructions and second type request instructions, wherein the interface is also configured to transmit to the networked computer terminals over the network electronic messages based on executed request instructions;
at least one processor;
at least one memory storing program instructions which when executed by the at least one processor, cause the at least one processor to:
store, during a first time period, the plurality of electronic request instructions in the at least one memory along with a corresponding receipt time indicator when each of the electronic request instructions was received at the interface;
detect expiration of a timer associated with the first time period;
process, during a second time period triggered by the expiration of the timer, the plurality of electronic request instructions from the at least one memory based on the corresponding receipt time indicator;
construct in the at least one memory a first table data structure, where each row in the first table data structure corresponds to a set of the first type request instructions, each column in the row in the first table data structure corresponds to a particular subset of the set of the first type request instructions, and a last row corresponds to a subset of combinations of the first type request instructions, by generating:
a first row of elements set to first values,
a second row of elements by copying the first row of elements and adding a bit-shifted copy of the first row of elements, and
a third row of elements by copying the second row of elements and adding a bit-shifted copy of the second row of elements, and
store the first table data structure in the at least one memory;
construct in the at least one memory a second table data structure, where each row in the second table data structure corresponds to a set of the second type request instructions, each column in the row in the second table data structure corresponds to a particular subset of the set of the second type request instructions, and a last row corresponds to a subset of combinations of the second type request instructions, by generating:
a first row of elements set to first values,
a second row of elements by copying the first row of elements and adding a bit-shifted copy of the first row of elements,
a third row of elements by copying the second row of elements and adding a bit-shifted copy of the second row of elements, and
store the second table data structure in the at least one memory;
determine an optimum common subset combination of the first type request instructions and the second type request instructions based on the respective last rows of the first and second table data structures in the at least one memory;
execute the request instructions for the subset of combinations of the first type request instructions and the subset of combinations of the second type request instructions corresponding to the optimum common subset combination; and
transmit to the networked computer terminals over the network, using the interface, at least one electronic message based on the executed request instructions.