# US 11,308,555 B2 · Synchronized processing of data by networked computing resources > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,308,555 B2 - Document ID: US11308555B2 - Status: Granted - Kind: B2 - Application number: 16/896,602 - Filed: 2020-06-09 - Published: 2020-09-24 - Granted: 2022-04-19 - Earliest claimed: 2009-12-10 - Assignees: Royal Bank of Canada - Applicants: Royal Bank of Canada - Inventors: Daniel Aisen; Bradley Katsuyama; Robert Park; John Schwall; Richard Steiner; Allen Zhang; Thomas L. Popejoy - Web page: https://patentgrep.com/patent/US11308555B2 ## CPC - G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange - H04L 43/0852: Delays - H04L 43/0858: {One way delays} - H04L 43/0864: Round trip delays - H04L 47/283: in response to processing delays, e.g. caused by jitter or round trip time [RTT] - H04L 67/62: Establishing a time schedule for servicing the requests - H04L 67/63: Routing a service request depending on the request content or context - G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## 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. ## Claims ### Claim 1 A method for coordinating processing requests by at least one processor, the method comprising: receiving, from one or more data sources, signals representing requests for execution of a plurality of data processes, each data process representing at least one trade request for execution by a plurality of computing resources, the plurality of computing resources connected to the at least one processor by at least one communication channel; associating, by the at least one processor, each of the plurality of data processes with a corresponding timing delay which is to elapse before the corresponding data process of the plurality of data processes is provided for execution, each of the corresponding timing delays determined based on a data process class of the respective data processes; and providing, by the at least one processor, to the plurality of computing resources via the at least one communication channel, each of the plurality of data processes for execution by the plurality of computing resources after the corresponding timing delay has elapsed. ### Claim 2 (depends on 1) The method of claim 1, wherein the timing delay is based at least in part on network latencies. ### Claim 3 (depends on 1) The method of claim 1, wherein the data process class is based on an order quantity range associated with the at least one trade request. ### Claim 4 (depends on 1) The method of claim 1, comprising: determining timing delays for association with the corresponding plurality of data processes such that the plurality of data processes are provided for execution in a desired sequence. ### Claim 5 (depends on 1) The method of claim 1, wherein at least one timing delay associated with at least one of the plurality of data processes is zero. ### Claim 6 (depends on 1) The method of claim 1, wherein the corresponding timing delay is selected from within a range of timing parameters. ### Claim 7 (depends on 1) The method of claim 1, comprising: determining timing delays for association with the corresponding plurality of data processes such that the timing delays reduce an amount of time during which a third party can react to at least one of the at least one trade request. ### Claim 8 (depends on 7) The method of claim 7, wherein the timing delays are determined to reduce an amount of time during which the third party can enact an opportunistic trade in reaction to at least one of the at least one trade request. ### Claim 9 (depends on 1) The method of claim 1, wherein the corresponding timing delay is based at least in part on a time threshold within which a third party can react to at least one of the at least one trade request. ### Claim 10 A system for coordinating processing of data by multiple networked computing resources, the system comprising at least one processor configured to: receive, from one or more data sources, signals representing requests for execution of a plurality of data processes, each data process representing at least one trade request for execution by a plurality of computing resources, the plurality of computing resources connected to the at least one processor by at least one communication channel; associate, by the at least one processor, each of the plurality of data processes with a corresponding timing delay which is to elapse before the corresponding data process of the plurality of data processes is provided for execution, each of the corresponding timing delays determined based on a data process class of the respective data processes; and provide, by the at least one processor, to the plurality of computing resources via the at least one communication channel, each of the plurality of data processes for execution by the plurality of computing resources after the corresponding timing delay has elapsed. ### Claim 11 (depends on 10) The system of claim 10, wherein the timing delay is based at least in part on network latencies. ### Claim 12 (depends on 10) The system of claim 10, wherein the data process class is based on an order quantity range associated with the at least one trade request. ### Claim 13 (depends on 10) The system of claim 10, wherein the at least one processor is configured to: determine timing delays for association with the corresponding plurality of data processes such that the plurality of data processes are provided for execution in a desired sequence. ### Claim 14 (depends on 10) The system of claim 10, wherein at least one timing delay associated with at least one of the plurality of data processes is zero. ### Claim 15 (depends on 10) The system of claim 10, wherein the corresponding timing delay is selected from within a range of timing parameters. ### Claim 16 (depends on 10) The system of claim 10, wherein the at least one processor is configured to: determine timing delays for association with the corresponding plurality of data processes such that the timing delays reduce an amount of time during which a third party can react to at least one of the at least one trade request. ### Claim 17 (depends on 16) The system of claim 16, wherein the timing delays are determined to reduce an amount of time during which the third party can enact an opportunistic trade in reaction to at least one of the at least one trade request. ### Claim 18 (depends on 10) The system of claim 10, wherein the corresponding timing delay is based at least in part on a time threshold within which a third party can react to at least one of the at least one trade request. ### Claim 19 A non-transitory, computer-readable medium or media having stored thereon computer-readable instructions which when executed by at least one processor cause the least one processor to: receive, from one or more data sources, signals representing requests for execution of a plurality of data processes, each data process representing at least one trade request for execution by a plurality of computing resources, the plurality of computing resources connected to the at least one processor by at least one communication channel; associate, by the at least one processor, each of the plurality of data processes with a corresponding timing delay which is to elapse before the corresponding data process of the plurality of data processes is provided for execution, each of the corresponding timing delays determined based on a data process class of the respective data processes; and provide, by the at least one processor, to the plurality of computing resources via the at least one communication channel, each of the plurality of data processes for execution by the plurality of computing resources after the corresponding timing delay has elapsed. ### Claim 20 (depends on 19) The medium or media of claim 19, wherein when executed, the computer-readable instructions cause the at least one processor to: determine timing delays for association with the corresponding plurality of data processes such that the plurality of data processes are provided for execution in a desired sequence.