No abstract

No abstract

SUMMARYThis paper focuses on comparing different heterogeneous computational designs for the calculation of rainbow options prices using the Fourier‐cosine series expansion (COS) method. We also propose a simple enough way to automatically decide the ratio of load balancing at runtime. A general‐purpose computing on graphic processing unit implementation of the two‐dimensional composite Simpson rule free of conditional statements with some degree of loop unrolling is also introduced. We will also show how to reduce the integration domain of coefficients appearing in the option pricing and by doing so achieve a substantial speed‐up and improve accuracy when compared with a straightforward implementation. Copyright © 2014 John Wiley & Sons, Ltd.

This paper focuses on comparing different heterogeneous computational designs for the calculation of Rainbow options prices using the Fourier-cosine series expansion (COS) method. We also propose a simple enough way to automatically decide ratio of load balancing at runtime. A GPGPU implementation of the two-dimensional composite Simpson rule free of conditional statements with some degree of loop unrolling is also introduced. We will also show how to reduce the integration domain of coefficients appearing in the option pricing and by doing so, achieve a substantial speed-up and improve accuracy when compared versus a straightforward implementation.

No abstract