{"title":"一种GPU加速的混合格网期权定价算法","authors":"Joan O. Omeru, David B. Thomas","doi":"10.1109/HPCSim.2014.6903765","DOIUrl":null,"url":null,"abstract":"The pricing of financial derivatives is an important problem in risk analysis and real-time trading. The need for faster and more accurate pricing has led financial institutions to adopt GPU technology, but this means we need new pricing algorithms designed specifically for GPU architectures. This research tackles the design of adaptable algorithms for option evaluation using lattices, a commonly used numerical technique. Usually lattice nodes are placed on a fixed grid at a high resolution, but by coarsening the grid in areas of low error, we can reduce run-time without a reduction in accuracy. We show that this adaptable grid can be designed to map onto the underlying architecture of warp-based GPUs, providing a tradeoff between faster execution at the same error, or lower error for the same execution speed. We implemented this algorithm in platform-independent OpenCL, and evaluated it on the Nvidia Quadro K4000, across different option classes. We present accuracy and speed-up results from using our hybrid lattice mesh model over an equivalent standard lattice implementation.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"4 12 1","pages":"758-765"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A GPU accelerated hybrid lattice-grid algorithm for options pricing\",\"authors\":\"Joan O. Omeru, David B. Thomas\",\"doi\":\"10.1109/HPCSim.2014.6903765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The pricing of financial derivatives is an important problem in risk analysis and real-time trading. The need for faster and more accurate pricing has led financial institutions to adopt GPU technology, but this means we need new pricing algorithms designed specifically for GPU architectures. This research tackles the design of adaptable algorithms for option evaluation using lattices, a commonly used numerical technique. Usually lattice nodes are placed on a fixed grid at a high resolution, but by coarsening the grid in areas of low error, we can reduce run-time without a reduction in accuracy. We show that this adaptable grid can be designed to map onto the underlying architecture of warp-based GPUs, providing a tradeoff between faster execution at the same error, or lower error for the same execution speed. We implemented this algorithm in platform-independent OpenCL, and evaluated it on the Nvidia Quadro K4000, across different option classes. We present accuracy and speed-up results from using our hybrid lattice mesh model over an equivalent standard lattice implementation.\",\"PeriodicalId\":6469,\"journal\":{\"name\":\"2014 International Conference on High Performance Computing & Simulation (HPCS)\",\"volume\":\"4 12 1\",\"pages\":\"758-765\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on High Performance Computing & Simulation (HPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCSim.2014.6903765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCSim.2014.6903765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A GPU accelerated hybrid lattice-grid algorithm for options pricing
The pricing of financial derivatives is an important problem in risk analysis and real-time trading. The need for faster and more accurate pricing has led financial institutions to adopt GPU technology, but this means we need new pricing algorithms designed specifically for GPU architectures. This research tackles the design of adaptable algorithms for option evaluation using lattices, a commonly used numerical technique. Usually lattice nodes are placed on a fixed grid at a high resolution, but by coarsening the grid in areas of low error, we can reduce run-time without a reduction in accuracy. We show that this adaptable grid can be designed to map onto the underlying architecture of warp-based GPUs, providing a tradeoff between faster execution at the same error, or lower error for the same execution speed. We implemented this algorithm in platform-independent OpenCL, and evaluated it on the Nvidia Quadro K4000, across different option classes. We present accuracy and speed-up results from using our hybrid lattice mesh model over an equivalent standard lattice implementation.