Nasdaq, Inc.

Kyle Prem

John Vaccaro

Hemant Thombre

Charles Mack

Andrew Oppenheimer

Andrey Tsiporukha

Tal Cohen

Tai Cohen

In some embodiments a distributed computing system is provided that includes a plurality of different feature modules and a matching engine. The different feature modules each provide different processing for handling parent requests and submitting, to the matching engine, commands for child data transaction requests that are associated with the parent request.

Systems and methods of distributed processing

A distributed computing system is provided that communicates with a routing computer system. A routing module that is internal to the distributed computing system controls how and when data transaction requests are sent to the routing computer system for routing to destination systems.

Systems and methods of routing data transaction messages for distributed systems

A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Delayed processing for electronic data messages in a distributed computer system

Systems and methods of validating commands sent from processing instances to a matching engine in a distributed processing environment

A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list&#x2014;where it is eligible to be matched against other, contra-side electronic data messages.

Growing community of inventors

Hartsdale, NY, United States of America

Kyle Prem