
Benchmarking
Call Option Pricing with Arithmetic Brownian Motion
Modeling the price evolution of a financial instrument in the presence of fluctuating market conditions is a critical task for many financial institutions. Traditional Monte Carlo simulations of an arithmetic Brownian motion (ABM) process typically use thousands to hundreds of thousands of price paths across 252 trading days. This example implements the ABM model from the Oosterlee-Grzelak book [1] and computes the distribution of the payoff of a European call option.

Figure 1. ...
When running on the Signaloid Cloud Compute Engine (SCCE), the application replaces individual samples for each price path with a direct computation on a representation of the probability distribution. In a single computation, the SCCE computes the same payoff distribution that traditional Monte Carlo simulations require millions of iterations to achieve.

Figure 2. ...
An ABM call option kernel, running on a single-threaded Signaloid C0Pro-XL core, achieves runtimes 24× faster than an optimized C-language Monte-Carlo-based implementation (i.e., the industry standard and status quo) running on an Amazon EC2 R7iz instance. With 95% confidence, a 6.4M-iteration Monte Carlo implementation matches the accuracy of the Signaloid UxHw-based version. If higher confidence is required for the Monte Carlo results, the speedup of the UxHw approach becomes even more pronounced.
[1] Oosterlee, C.W. and Grzelak, L.A. 2019. Mathematical Modeling And Computation In Finance: With Exercises And Python And Matlab Computer Codes. World Scientific Publishing Company.
Key Performance Indicator
Signaloid Platform Solution
Competing Solution
Signaloid Benefit
Speed for the same uncertainty quantification accuracy.
Run existing non-Monte-Carlo code and use either the Signaloid Compute Engine's automated ingestion of distribution information, or use the Signaloid UxHw API to set program variables as probability distributions.
Run existing Monte Carlo code, or, starting from non-Monte-Carlo code, modify code to implement Monte Carlo sampling, iteration, and aggregation of the results from the Monte Carlo iterations of the computation.
24x faster execution time than 6.4M-iteration Monte Carlo, while achieving same fidelity of full distribution result.
Benchmarking Methodology
Monte Carlo simulations work by statistical sampling and therefore each multi-iteration Monte Carlo run will result in a slightly different output distribution. By contrast, Signaloid's platform is deterministic and each run produces the same distribution for a given Signaloid C0 core type.
The performance improvements are calculated by comparing Signaloid's platform with a Monte Carlo simulation of a similar quality of distribution. First, we run a large Monte Carlo simulation (about 50M iterations) on an AWS r7iz high-performance AWS instance: We use this distribution result as a baseline or ground truth reference of distribution quality. Then we calculate the performance of Signaloid's technology, and compare it with the performance of a Monte Carlo iteration count where the output distribution's Wasserstein distance (to the output distribution of the ground truth reference) is as accurate as the Signaloid-core-executed algorithm's output distribution, with 95% confidence level.
Performance data based on Fall 2025 release of Signaloid's technology.