Abstract: A method of processing exchange system trading data is disclosed. In one embodiment, the method comprises receiving an order data message from a matching engine of an automated exchange. The order data message has first data format and it also comprises identification information associated with a trading entity. The received data message is then converted into a new data message of a new data format, which is different from the data format of the received order data message. Also, the trading entity from which the received order data message is originating is identified. Subsequently, the new data message having the new data format can be transmitted to a plurality of client devices associated with the identified trading entity. This may allow for all, or at least a majority of client devices, of the identified trading entity to get an overview of the total order activity of the identified trading entity.

Abstract: The present invention relates to a method and system for facilitating access to recorded data. The system comprises an interface and a processing device. The interface is arranged to receive data and the processing device is arranged to separate the received data in data subsets, compress each data subset and assign an identifier to each compressed data subset, thereby creating data units each comprising a compressed data subset and an associated identifier, the processing device further being arranged to establish an index on the basis of the assigned identifiers.

Abstract: Methods and computerized exchange systems 100 for processing trade orders are disclosed. In the computerized exchange system 100, a sequencer 130 is configured to sequence incoming order entry messages for thereby putting incoming order entry messages in a sequenced order and to send, from the sequencer, order entry message(s) in a sequenced order to a plurality of order book engines 120a-c. Upon receipt of the sequenced order entry message(s) in the various order book engines 120-c, the plurality of order book engines process the sequenced order entry message(s) substantially in parallel. Various embodiments of the disclosed methods and computerized exchange systems allow for better performance, e.g. in terms of lower latency.

Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.

Abstract: In a distributed network, there are different data rates on different connections between a central computer system and remote terminal. The central computer system includes one or more sets of data to be distributed to the remote terminals by extracting subsets of data from the set(s) of data. The subsets of data are distributed to selected groups of remote terminals based on an infrastructure load in order to adaptively distribute the data.

Abstract: A computer system is provided that stores reference data records and event data records that each correspond to one of the reference data records. Tokens are generated from the reference data records and sorted into subsets. Each reference data record that has a given token is included in the corresponding subset. A correlation value is calculated between members (e.g., the reference data records) of the subsets. The correlation values are calculated by determining a common time, calculating a reference value, calculating a percentage difference from the reference value, and then determining a correlation value (e.g., a correlation coefficient) using the percentage difference.

Abstract: Elastic message tracking apparatus and methods are provided that opportunistically improve on the latency of a message processing system and increase the accuracy of a consolidated message stream generated from message streams received from multiple message sources. The elastic message tracking apparatus and methods reduce that latency in situations where the actual latency of all the message streams is lower than a predetermined latency value.

Abstract: The present technology relates to distributed computerized exchange systems for trading of financial instruments. In particular it relates to a passive matching engine and an active matching engine that cooperates in handling data messages such that less bandwidth is used and so that improvement in latency can be achieved.

Abstract: A computer system that interfaces with a blockchain is provided. The computer system receives match data for a match between a first data transaction request that is associated with a first identifier and a second data transaction request that is associated with a second identifier. A first blockchain transaction is generated based on the match data and stored to a blockchain. At least one further blockchain transaction is generates that splits the match into two different transactions—one between the first identifier and an intermediary and the second between the intermediary. These are recorded to the blockchain via the further blockchain transactions.

Abstract: A network routing table includes destination addresses of destination applications hosted on peer nodes of a network. A primary processor registers a first destination application and a second destination application, where the first destination application is the same as the second destination application and both the first destination application and the second destination application have the same destination address. That processor also provides the peer nodes and a secondary processor with a copy of the table. When the first destination application is inactivated, all peer nodes and the secondary processor are provided with a copy of an updated routing table indicating inactivation of the first destination application and routing of the application message to the second destination application.

Abstract: The technology performs obligations fulfillment monitoring. An input data stream of data messages is received including transaction data and reference data, obligation control logic, and a set of obligation parameters associated with the obligation control logic. An event data processor processes the input data stream using a current version of the obligation control logic and the set of obligation parameters. Subsequently, the event processor receives information to implement and execute obligation control logic that is dynamically-modified and different from the current version of the obligation control logic. The event processor generates and outputs an obligation fulfillment message based on the dynamically-modified obligation logic and transmits to an interested entity.

Abstract: A derivative trade order at a home marketplace is routed to an away market place having a better price for a counter position to the order where it is executed. The executed order triggers creation of a “balance derivative trade” at the home marketplace to balance at a home clearing house the away trade. The home clearing house uses the balance derivative trade to create derivative positions of the balance derivative trade and informs a balancing clearing entity which manages the balance derivative trade obligations. The balance derivative trade order account permits netting and reduced margin benefits for the trading participant. A dual derivative exercise operation allows balance derivative positions to be performed in one day to reduce overnight risk for the clearing entity.

Abstract: Control circuitry controls the operations of a central processing unit, CPU, which is associated with a nominal clock frequency. The CPU is further coupled to an I/O range and configured to deliver input to an application. The control circuitry controls the CPU to poll the I/O range for input to the application. The control circuitry also monitors whether or not each poll results in input to the application and adjusts a clock frequency at which the CPU operates to a clock frequency lower than the nominal clock frequency if a pre-defined number of polls resulting in no input is detected. Methods and a central computer server of an automated exchange system are also provided.

Abstract: A computerized trading system receives buy and sell trade orders in financial instruments traded in the central trading system from user terminals connected to the central trading system is provided. Users and/or user terminals are associated with different offset spread values. The trading system transmits price information and associated offset spread values to different user terminals. Each of the user terminals displays an actual price for the instrument that corresponds to the combined price information and associated offset spread value.

Abstract: A computer system that interfaces with a blockchain is provided. The computer system receives match data for a match between a first data transaction request that is associated with a first identifier and a second data transaction request that is associated with a second identifier. A first blockchain transaction is generated based on the match data and stored to a blockchain. At least one further blockchain transaction is generates that splits the match into two different transactions—one between the first identifier and an intermediary and the second between the intermediary. These are recorded to the blockchain via the further blockchain transactions.

Abstract: Example embodiments relate to a method of, and device for facilitating, resilient peer-to-peer application message routing. The method comprises storing a network routing table comprising destination addresses of applications hosted on peer nodes of a network, and providing the peer nodes with a copy of the routing table via which routing table an application message from any one of the peer nodes is routed to a destination address designating a destination application hosted by a destination peer node.

Abstract: An asynchronous distributed computing system with a plurality of computing nodes is provided. One of the computing nodes includes a sequencer service that receives updates from the plurality of computing nodes. The sequencer service maintains or annotates messages added to the global state of the system. Updates to the global state are published to the plurality of computing nodes. Monitoring services on the other computing nodes write the updates into a locally maintained copy of the global state that exists in shared memory on each one of the nodes. Client computer processes on the nodes may then subscribe to have updates “delivered” to the respective client computer processes.

Abstract: Apparatus and methods for managing messages in a computer system are described. A plurality of order/quote messages is received via an input mechanism, and the order/quote messages are ranked based on the at least one ranking value parameter at a first ranking unit. At least one top ranked order/quote message is sent from the first ranking unit to a matching unit, and the top ranked order/quote messages are matched at the matching unit.

Abstract: The technology is suitable for any kind of distributed networks having different data rates on different connections and a computer system where the data to distribute is created. The system comprises one or more supersets of data to be distributed to client computers by extracting subsets of data from the superset(s) of data. Thereafter, the subsets of data are distributed to selected groups of clients based on information about the network architecture. This provides an efficient way of distributing data without having to duplicate distributed data. In example implementations, subsets may be distributed to clients based on a counter performance or a data rate of a client's connection to the computer system.

Abstract: A screen sharing presentation system includes a presenter client system that leads a presentation and listener client systems that follow the presentation. A server facilitates communication between the presenter client system and the listener client systems. Users of the client systems may provide annotation information for the presentation. The annotation data is not visible to other users of other client systems, but is displayed on the respective user's personal views of the presentation. The presenter client system and the listener client systems are synchronized by communicating a current document location or other status indications.