Parallelizing Tree Traversals for Binomial Option Pricing
Quantitative finance analysts and software developers often need to develop efficient software implementations of pricing models, hedging tools, and other financial algorithms in order to support their research. Some of the most commonly used quantitative analysis tools include binomial trees, which...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2022
|
| Online Access: | https://hdl.handle.net/1721.1/144876 |
| _version_ | 1811083328849182720 |
|---|---|
| author | Brunelle, Terryn |
| author2 | Shun, Julian |
| author_facet | Shun, Julian Brunelle, Terryn |
| author_sort | Brunelle, Terryn |
| collection | MIT |
| description | Quantitative finance analysts and software developers often need to develop efficient software implementations of pricing models, hedging tools, and other financial algorithms in order to support their research. Some of the most commonly used quantitative analysis tools include binomial trees, which are useful to represent possible future model states and estimate the current value of an asset.
Open-source libraries such as QuantLib provide tools to help analysts implement such algorithsms without needing to reinvent widely studied logic. Though such libraries are widely used by quantative finance developers in industry and academia, the algorithms presented for binomial tree traversals do not take advantage of parallelism or optimizations for cache locality, such as those proposed by Zubair and Mukkamala in 2008. The optimizations presented by Zubair and Mukkamala have not been tested on modern machines, nor have they been implemented in a way accessible to quantatative analysts.
We provide a performance analysis of the cache optimizations presented by Zubair and Mukkamala on modern machines. Beyond this, we contribute an open-source framework that enables developers to compute a variety of binomial option-types using an easy-to-use programming interface and taking advantage of the parallel, cache-optimized algorithm developed by Zubair and Mukkamala. We find that our optimizations achieve up to a factor of a seven times speedup over a vanilla serial implementation, and a two times speedup up over a vanilla paralllel implementation. Our performance results support the direction of continuing to explore cacheoptimized algorithms for tree traversals and seeking to create generalized frameworks for more widespread use. |
| first_indexed | 2024-09-23T12:31:19Z |
| format | Thesis |
| id | mit-1721.1/144876 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T12:31:19Z |
| publishDate | 2022 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1448762022-08-30T03:35:04Z Parallelizing Tree Traversals for Binomial Option Pricing Brunelle, Terryn Shun, Julian Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Quantitative finance analysts and software developers often need to develop efficient software implementations of pricing models, hedging tools, and other financial algorithms in order to support their research. Some of the most commonly used quantitative analysis tools include binomial trees, which are useful to represent possible future model states and estimate the current value of an asset. Open-source libraries such as QuantLib provide tools to help analysts implement such algorithsms without needing to reinvent widely studied logic. Though such libraries are widely used by quantative finance developers in industry and academia, the algorithms presented for binomial tree traversals do not take advantage of parallelism or optimizations for cache locality, such as those proposed by Zubair and Mukkamala in 2008. The optimizations presented by Zubair and Mukkamala have not been tested on modern machines, nor have they been implemented in a way accessible to quantatative analysts. We provide a performance analysis of the cache optimizations presented by Zubair and Mukkamala on modern machines. Beyond this, we contribute an open-source framework that enables developers to compute a variety of binomial option-types using an easy-to-use programming interface and taking advantage of the parallel, cache-optimized algorithm developed by Zubair and Mukkamala. We find that our optimizations achieve up to a factor of a seven times speedup over a vanilla serial implementation, and a two times speedup up over a vanilla paralllel implementation. Our performance results support the direction of continuing to explore cacheoptimized algorithms for tree traversals and seeking to create generalized frameworks for more widespread use. M.Eng. 2022-08-29T16:17:54Z 2022-08-29T16:17:54Z 2022-05 2022-05-27T16:19:07.961Z Thesis https://hdl.handle.net/1721.1/144876 In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ application/pdf Massachusetts Institute of Technology |
| spellingShingle | Brunelle, Terryn Parallelizing Tree Traversals for Binomial Option Pricing |
| title | Parallelizing Tree Traversals for Binomial Option Pricing |
| title_full | Parallelizing Tree Traversals for Binomial Option Pricing |
| title_fullStr | Parallelizing Tree Traversals for Binomial Option Pricing |
| title_full_unstemmed | Parallelizing Tree Traversals for Binomial Option Pricing |
| title_short | Parallelizing Tree Traversals for Binomial Option Pricing |
| title_sort | parallelizing tree traversals for binomial option pricing |
| url | https://hdl.handle.net/1721.1/144876 |
| work_keys_str_mv | AT brunelleterryn parallelizingtreetraversalsforbinomialoptionpricing |