Quant / Built
Lock Free Limit Order Book
Match orders by price and arrival time using concurrent data structures.
- My contribution
- Implemented order matching by price and arrival time, concurrent queues, risk checks, and an event log.
C++20 / React / WebSocket
The problem
A matching engine needs predictable ordering while coordinating producers and downstream consumers.
Implementation
The C++20 implementation combines MPSC and SPSC queues with matching by price and arrival time, risk checks before trading, an event log, and NASDAQ ITCH parsing. A WebSocket interface connects the engine to visualization.
Evaluation & limitations
Throughput and latency depend on hardware, build options, and workload. Reproducible benchmarks are not yet available.