Abstract: A method for generating a prediction of a latency of a transaction processing system includes: sampling a first plurality of messages from a database that stores data indicative of messages previously processed by the transaction processing system including a characteristic and a processing time of each previously processed message; generating latency tables based upon the characteristics and the processing times of the sampled first plurality of messages; determining a characteristic of each of a second plurality of messages being processed by the transaction processing system; selecting, for each of the second plurality of messages, a latency table from the plurality of latency tables based upon the respective determined characteristic; simulating a processing time for each of the second plurality of messages based upon the respective selected latency table; and generating a latency prediction for the transaction processing system based upon the simulated processing times for the second plurality of message

Abstract: The disclosed embodiments relate to a mechanism for allowing concurrent access, e.g., write operations, to a data structure, e.g., a file, which may have limited capacity, by multiple processes or threads and, in particular, for allowing concurrent, or otherwise substantially simultaneously, appending of data to the file thereby. Each process/thread requests the amount of space it needs to append its data. Upon request, the disclosed mechanism allocates and reserves the requested amount of space and allows the requesting process/thread to commence its append operation. Subsequent to the commencement of the append operation, another thread is then free to request space for its needs and commence its append operation concurrently, or otherwise substantially simultaneously, with the previous append operation, i.e. before the prior append operation is completed.

Abstract: A method for generating a prediction of a latency of a transaction processing system includes: sampling a first plurality of messages from a database that stores data indicative of messages previously processed by the transaction processing system including a characteristic and a processing time of each previously processed message; generating latency tables based upon the characteristics and the processing times of the sampled first plurality of messages; determining a characteristic of each of a second plurality of messages being processed by the transaction processing system; selecting, for each of the second plurality of messages, a latency table from the plurality of latency tables based upon the respective determined characteristic; simulating a processing time for each of the second plurality of messages based upon the respective selected latency table; and generating a latency prediction for the transaction processing system based upon the simulated processing times for the second plurality of message

Abstract: The disclosed embodiments relate to a mechanism for allowing concurrent access, e.g. write operations, to a data structure, e.g. a file, which may have limited capacity, by multiple processes or threads and, in particular, for allowing concurrent, or otherwise substantially simultaneously, appending of data to the file thereby. Each process/thread requests the amount of space it needs to append its data. Upon request, the disclosed mechanism allocates and reserves the requested amount of space and allows the requesting process/thread to commence its append operation. Subsequent to the commencement of the append operation, another thread is then free to request space for its needs and commence its append operation concurrently, or otherwise substantially simultaneously, with the previous append operation, i.e. before the prior append operation is completed.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A method for generating a prediction of a latency of a transaction processing system includes: sampling a first plurality of messages from a database that stores data indicative of messages previously processed by the transaction processing system including a characteristic and a processing time of each previously processed message; generating latency tables based upon the characteristics and the processing times of the sampled first plurality of messages; determining a characteristic of each of a second plurality of messages being processed by the transaction processing system; selecting, for each of the second plurality of messages, a latency table from the plurality of latency tables based upon the respective determined characteristic; simulating a processing time for each of the second plurality of messages based upon the respective selected latency table; and generating a latency prediction for the transaction processing system based upon the simulated processing times for the second plurality of message

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A method for generating a prediction of a latency of a transaction processing system includes: sampling a first plurality of messages from a database that stores data indicative of messages previously processed by the transaction processing system including a characteristic and a processing time of each previously processed message; generating latency tables based upon the characteristics and the processing times of the sampled first plurality of messages; determining a characteristic of each of a second plurality of messages being processed by the transaction processing system; selecting, for each of the second plurality of messages, a latency table from the plurality of latency tables based upon the respective determined characteristic; simulating a processing time for each of the second plurality of messages based upon the respective selected latency table; and generating a latency prediction for the transaction processing system based upon the simulated processing times for the second plurality of message

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A data transaction processing system including multiple transaction processors also includes a resource allocation system that characterizes the transaction processors based on input output electronic data transaction request message patterns associated with the transaction processors. The resource allocation system dynamically allocates computing resources, such as data path bandwidth, processor priority, CPU cores, memory, and processing threads to the various transaction processors and components therein based upon the transaction processor characterizations, improving the overall processing throughput, resource utilization, and efficiency of the multi-transaction processor system.

Abstract: A system and method deliver cryptocurrency on an expiring futures contract. A settlement wallet stores or manages one or more cryptographic keys that controls the transfer of cryptographic currency. The cryptographic keys are subject to a non-party's custody that guarantees fulfillment on an expiring cryptocurrency futures contract. The system and method link the settlement wallet to an exchange wallet that stores or manages one or more other cryptographic keys that controls the transfer of other cryptographic currency dynamically. The system and method physically deliver cryptocurrency to a counterparty in a futures contract.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages based on the other messages in the same group before forwarding the electronic data transaction request messages to a transaction processor.

Abstract: A data transaction processing system including multiple transaction processors also includes a resource allocation system that characterizes the transaction processors based on input output electronic data transaction request message patterns associated with the transaction processors. The resource allocation system dynamically allocates computing resources, such as data path bandwidth, processor priority, CPU cores, memory, and processing threads to the various transaction processors and components therein based upon the transaction processor characterizations, improving the overall processing throughput, resource utilization, and efficiency of the multi-transaction processor system.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.