Synchronized processing of data by networked computing resources
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.
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, wherein the respective timing delay is selected from within a range of timing parameters; 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.
2. The method of claim 1 , wherein the timing delay is based at least in part on network latencies.
3. 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.
4. 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.
5. The method of claim 1 , wherein at least one timing delay associated with at least one of the plurality of data processes is zero.
6. The method of claim 1 , wherein the corresponding timing delay is based on at least one of offsets or scaling factors.
7. 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.
8. 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.
9. 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.
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, wherein the respective timing delay is selected from within a range of timing parameters; 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.
11. The system of claim 10 , wherein the timing delay is based at least in part on network latencies.
12. 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.
13. 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.
14. The system of claim 10 , wherein at least one timing delay associated with at least one of the plurality of data processes is zero.
15. The system of claim 10 , wherein the corresponding timing delay is based on at least one of offsets or scaling factors.
16. 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.
17. 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.
18. 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.
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, wherein the respective timing delay is selected from within a range of timing parameters; 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.
20. 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.