Synchronized processing of data by networked computing resources
AssigneeRoyal Bank of Canada
InventorsDaniel Aisen, Bradley Katsuyama, Robert Park, John Schwall, Richard Steiner, Allen Zhang, Thomas L. Popejoy
Life of this patent
Estimating the term…
Abstract
Systems 100, 1000, methods, and machine-interpretable programming or other instruction products for the management of data processing by multiple networked computing resources 106, 1106. In particular, the disclosure relates to the synchronization of related requests for processing of data using distributed network resources.
Claims18
A system for coordinating processing of data by multiple networked computing resources, the system comprising at least one processor configured to:
- receive or generate from one or more data sources signals representing instructions for execution of a plurality of proposed transactions in one or more financial interests by a plurality of networked computing resources;
- associate each of the plurality of proposed transactions with a corresponding networked computing resource;
- determine a timing sequence for routing the plurality of proposed transactions, the timing sequence defining a sequence and delays between times that the plurality of proposed transactions are to be routed, the timing sequence determined such that a difference between:
- an execution or arrival time of a proposed transaction of the plurality of proposed transactions which executes or arrives the earliest at its corresponding networked computing resource, and
- an execution or arrival time of a proposed transaction of the plurality of proposed transactions which executes or arrives the latest at its corresponding networked computing resource
- is less than a defined time threshold;
- and
- route, in the timing sequence, the plurality of proposed transactions to their respective corresponding networked computing resource for execution.
A method for coordinating processing of data by multiple networked computing resources, the method performed by at least one processor configured to cause the at least one processor to:
- receive or generate from one or more data sources signals representing instructions for execution of a plurality of proposed transactions in one or more financial interests by a plurality of networked computing resources;
- associate each of the plurality of proposed transactions with a corresponding networked computing resource;
- determine a timing sequence for routing the plurality of proposed transactions, the timing sequence defining a sequence and delays between times that the plurality of proposed transactions are to be routed, the timing sequence determined such that a difference between:
- an execution or arrival time of a proposed transaction of the plurality of proposed transactions which executes or arrives the earliest at its corresponding networked computing resource, and
- an execution or arrival time of a proposed transaction of the plurality of proposed transactions which executes or arrives the latest at its corresponding networked computing resource
- is less than a defined time threshold;
- and
- route, in the timing sequence, the plurality of proposed transactions to their respective corresponding networked computing resource for execution.
A non-transitory, computer-readable medium or media having stored thereon computer readable instructions which when executed by at least one processor cause at least one processor to:
- receive or generate from one Or more data sources signals representing instructions for execution of a plurality of proposed transactions in one or more financial interests by a plurality of networked computing resources;
- associate each of the plurality of proposed transactions with a corresponding networked computing resource;
- determine a timing sequence for routing the plurality of proposed transactions, the timing sequence defining a sequence and delays between times that the plurality of proposed transactions are to be routed, the timing sequence determined such that a difference between:
- an execution or arrival time of a proposed transaction of the plurality of proposed transactions which executes or arrives the earliest at its respective networked computing resource, and
- an execution or arrival time of a proposed transaction of the plurality of proposed transactions which executes or arrives the latest at its corresponding networked computing resource
- is less than a defined time threshold;
- and
- route, in the timing sequence, the plurality of proposed transactions to their respective corresponding networked computing resource for execution.
Dependencies are inferred from the claim text.