Going parallel over the rainbow

Some parallel algorithms are proposed to speed up computation of multivariate lattices used to evaluate rainbow options. These novel algorithms have been programmed using multi-threaded syntax in Gauss^tm of Aptech honing codes for 32 and 128 cores machines. Actual scaling is linear or superlinear in excess of Amdahl theoretical thresholds. Rainbow options have been valued with several multivariate lattices models programmed according to our parallelization algorithms providing results not found in extant literature in terms of granularity and convergence. Keywords: Rainbow Options, multivariate binomial lattices, multivariate trinomial lattices, parallel computation, multithreaded programming, multicore machines.