Nasdaq Technology Ab

Robert Adolfsson

Daniel Hilton

Patrik Färnlöf

Björn Carlson

Michael Craig

Jan Tilfors

Patrik Farnlof

Björn Rolf Carlsson

The described technology relates to a publish-subscribe message framework in which an application, decomposed to a plurality of processing stages, is run by executing respective processing stages of the application asynchronously and simultaneously with each other. Communications between the respective processing stages may exclusively be in accordance with the publish-subscribe execution model. The described publish-subscribe framework provides for processing stages to be executed in a multi-process and/or multi-threaded manner while also enabling the distribution of the processing stages to respective processing resources in a multi-processor/multi-core processing environment. An example electronic exchange application and a corresponding example exchange gateway application are described.

Publish-subscribe framework for application execution

A computer is provided that includes a search engine. The search engine is configured to receive a search request and conduct a search against a database. Each record within the database includes or is associated with a display criteria or profile that specifies when data from that record can be included into a response to a search.

Systems and methods of conditional search techniques

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.

Efficient and reliable host distribution of totally ordered global state

The described technology relates to a publish-subscribe message framework in which an application, decomposed to a plurality of processing stages, is run by executing respective processing stages of the application asynchronously and simultaneously with each other. Communications between the respective processing stages may exclusively be in accordance with the publish-subscribe execution model. The described publish-sub scribe framework provides for processing stages to be executed in a multi-process and/or multi-threaded manner while also enabling the distribution of the processing stages to respective processing resources in a multi-processor/multi-core processing environment. An example electronic exchange application and a corresponding example exchange gateway application are described.

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. A further application message addressed from any of the peer nodes to the destination address associated with the inactivated first destination application will be routed, via the updated routing table, to the second destination application having the same destination address as the inactivated first destination application. The secondary processor provides the copy of the routing table and the copy of the updated routing table in case of failure of the primary processor in response to a request from the querying peer node.

Resilient peer-to-peer application message routing

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. Further, the method comprises providing, when the destination application hosted by the destination peer node is inactivated, all peer nodes with a copy of an updated routing table taking into account the inactivation of said application, wherein a further application message addressed from any one of the peer nodes to the destination address associated with the inactivated application is routed via the updated routing table, to an alternative destination application having the same destination address as the inactivated application.

Growing community of inventors

Vega, Sweden

Robert Adolfsson