Abstract
Monte Carlo (MC) techniques are often used to price complex financial derivatives. The computational effort can be substantial when high accuracy is required. However, MC computations are latency tolerant, and are thus easily parallelize even with high communication overheads, such as in a distributed compacting environment. A drawback of MC is its relatively slow convergence rate, which can be overcome through the use of quasi Monte Carlo (QMC) techniques which use low discrepancy sequences. We discuss the issues that arise in parallelizing QMC, especially in a heterogeneous computing environment, and present results of empirical studies on arithmetic Asian options, using three parallel QMC techniques that have recently been proposed. We expect the conclusions to be valid for other applications too.
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 callDisclaimer: 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.
