Abstract
High-dimensional derivatives pricing, such as Asian basket options, poses great computational challenges in practice. In this paper, parallel Randomized Quasi-Monte Carlo (RQMC) simulation method is investigated to tackle this kind of intractable problems. By using the intrinsic nature of “embarrassingly parallel”, parallel RQMC algorithm for Asian basket option pricing is effectively implemented using MPI. Numerical experiments are performed on supercomputer DeepComp6800 and the parallel performance is then analyzed. Our parallel algorithm has exerted perfect performance and good scalability. Parallel computing has greatly improved the computational efficiency of derivatives pricing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Algorithms & Computational Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
