KineticSim: A Lightweight, High-Performance Execution Engine for Real-Time Market Simulators

By Shakya Jayakody, Prarthinie Jayakody

Rating

1277
Battle Count: 53

Relevance

8/10
Highly relevant as an enabling infrastructure for quantitative trading research. KineticSim allows massive-scale parameter sweeps (e.g., 10,000 configurations) that would be computationally prohibitive with CPU simulators like ABIDES. It directly supports backtesting, execution algorithm design, block trade optimization, and RL-based strategy training. However, it simulates call auctions rather than continuous double auctions (the dominant mechanism in most equity/crypto markets), limiting direct applicability to CDA-based trading. The 54.7 billion events/second throughput and 10x memory reduction make it practical for real-time simulation workloads.

Implementation Complexity

9/10
Requires deep expertise in CUDA programming, GPU memory hierarchy (shared vs global memory), warp-level primitives, cooperative thread synchronization (syncthreads), parallel scan algorithms (Hillis-Steele), atomic operations, and persistent kernel design. The work-depth complexity analysis and careful management of shared-memory lifetimes across step boundaries add significant engineering complexity. However, the code is stated to be publicly available, reducing the barrier for adoption. The design pattern itself is well-formalized and could be adapted by experienced GPU programmers.

Reproducibility

5/5
Source code, CUDA kernels, and benchmark suite stated to be publicly available on GitHub. 53 benchmark configurations across full symmetric sweeps with no omitted configurations. Two custom CUDA engines produce bitwise-identical order books. All backends agree on aggregate statistics within 0.1%. Analytical ground truth provided for clearing correctness. Results averaged over 5 trials (11 for latency). Hardware specifications fully disclosed (AMD Ryzen 9 9950X3D, NVIDIA RTX 5090, CUDA 13.2, PyTorch 2.10.0).

About this paper

Methodology: Persistent State-Carrying Clearing for Iterative Multi-Agent Reductions. Problem types: Simulation, Optimization, Market Making, Algorithmic Execution, Risk Management.

The interactive Everscope explorer (charts, battles, favorites) loads below.